Zobrazeno 1 - 10
of 254
pro vyhledávání: '"P. Magnant"'
Publikováno v:
Wind Energy Science, Vol 6, Pp 461-476 (2021)
Detailed simulation of wind generation as driven by weather patterns is required to quantify the impact on the electrical grid of the power fluctuations in offshore wind power fleets. This paper focuses on studying the power fluctuations of high-inst
Externí odkaz:
https://doaj.org/article/f62d4e53dab741888a702b57cdf6c4bb
Autor:
Magnant, Colton, Magnant, Zhuojun
A colored complete graph is said to be Gallai-colored if it contains no rainbow triangle. This property has been shown to be equivalent to the existence of a partition of the vertices (of every induced subgraph) in which at most two colors appear on
Externí odkaz:
http://arxiv.org/abs/1905.11794
Writing assignments in any mathematics course always present several challenges, particularly in lower-level classes where the students are not expecting to write more than a few words at a time. Developed based on strategies from several sources, th
Externí odkaz:
http://arxiv.org/abs/1905.07616
Given graphs $G$ and $H$ and a positive integer $k$, the Gallai-Ramsey number $gr_{k}(G : H)$ is the minimum integer $N$ such that for any integer $n \geq N$, every $k$-edge-coloring of $K_{n}$ contains either a rainbow copy of $G$ or a monochromatic
Externí odkaz:
http://arxiv.org/abs/1905.07615
Given a graph $G$ and a positive integer $k$, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of the complete graph $K_n$ contains either a rainbow (all different colored) triangle or a
Externí odkaz:
http://arxiv.org/abs/2007.07240
Given a graph $G$ and a positive integer $k$, the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) copy of $G$ or a monochromati
Externí odkaz:
http://arxiv.org/abs/2001.02789
Given a graph $G$ and a positive integer $k$, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy
Externí odkaz:
http://arxiv.org/abs/1908.02348
Analogous to the Type-$A_{n-1}=\mathfrak{sl}(n)$ case, we show that if $\mathfrak{g}$ is a Frobenius seaweed subalgebra of $B_{n}=\mathfrak{so}(2n+1)$ or $C_{n}=\mathfrak{sp}(2n)$, then the spectrum of the adjoint of a principal element consists of a
Externí odkaz:
http://arxiv.org/abs/1907.08775
Given a graph $G$ and a positive integer $k$, define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy
Externí odkaz:
http://arxiv.org/abs/1905.12414
When many colors appear in edge-colored graphs, it is only natural to expect rainbow subgraphs to appear. This anti-Ramsey problem has been studied thoroughly and yet there remain many gaps in the literature. Expanding upon classical and recent resul
Externí odkaz:
http://arxiv.org/abs/1905.10584