Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles

@article{Knierim2019ImprovedBO,
  title={Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles},
  author={Charlotte Knierim and Pascal Su},
  journal={Electron. J. Comb.},
  year={2019},
  volume={26},
  pages={P1.26}
}
We study the multicolor Ramsey numbers for paths and even cycles, $R_k(P_n)$ and $R_k(C_n)$, which are the smallest integers $N$ such that every coloring of the complete graph $K_N$ has a monochromatic copy of $P_n$ or $C_n$ respectively. For a long time, $R_k(P_n)$ has only been known to lie between $(k-1+o(1))n$ and $(k + o(1))n$. A recent breakthrough by Sárközy and later improvement by Davies, Jenssen and Roberts give an upper bound of $(k - \frac{1}{4} + o(1))n$. We improve the upper bound… Expand
Cycle Ramsey numbers for random graphs
Let $C_{n}$ be a cycle of length $n$. As an application of Szemeredi's regularity lemma, Łuczak ($R(C_n,C_n,C_n)\leq (4+o(1))n$, J. Combin. Theory Ser. B, 75 (1999), 174--187) in fact establishedExpand
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graphExpand
Bipartite Ramsey Numbers of Cycles for Random Graphs
  • Meng Liu, Yusheng Li
  • Computer Science, Mathematics
  • Graphs Comb.
  • 2021
TLDR
It is shown that any k-edge coloring of G contains a monochromatic H as a subgraph as well as a random graph spaces with edge probability p. Expand
Multicolour Bipartite Ramsey Number of Paths
TLDR
This paper determines asymptotically the $4$-colour bipartite Ramsey number of paths and cycles which are close to being tight and provides new upper bounds on the $k$- Colour bipartites Ramsey numbers which are Close to being Tight. Expand
On multicolor Ramsey numbers of triple system paths of length 3
Let $\mathcal{H}$ be a 3-uniform hypergraph. The multicolor Ramsey number $ r_k(\mathcal{H})$ is the smallest integer $n$ such that every coloring of $ \binom{[n]}{3}$ with $k$ colors has aExpand
Bipartite Ramsey numbers of large cycles
For an integer $r\geq 2$ and bipartite graphs $H_i$, where $1\leq i\leq r$, the bipartite Ramsey number $br(H_1,H_2,\ldots,H_r)$ is the minimum integer $N$ such that any $r$-edge coloring of theExpand
3-Color bipartite Ramsey number of cycles and paths
TLDR
This paper determines asymptotically the $3$-colour bipartite Ramsey number of paths and (even) cycles. Expand
Three colour bipartite Ramsey number of cycles and paths
The k-colour bipartite Ramsey number of a bipartite graph H is the least integer n for which every k-edge-coloured complete bipartite graph Kn,n contains a monochromatic copy of H. The study ofExpand
Monochromatic connected matchings in 2-edge-colored multipartite graphs
A matching $M$ in a graph $G$ is {\em connected} if all the edges of $M$ are in the same component of $G$. Following Łuczak, there are a number of results using the existence of large connectedExpand
An improvement on Luczak’s connected matchings method
A connected matching in a graph G is a matching contained in a connected component of G. A well-known method due to Luczak reduces problems about monochromatic paths and cycles in complete graphs toExpand
...
1
2
...

References

SHOWING 1-10 OF 23 REFERENCES
On the Multi-Colored Ramsey Numbers of Paths and Even Cycles
TLDR
The upper bound on the multi-color Ramsey numbers of paths and even cycles is improved and a stability version of the Erdős-Gallai theorem is introduced that may be of independent interest. Expand
The 3-colored Ramsey number of even cycles
TLDR
It is proved that there exists n"1 such that for every even n>=n"1, R(C"n,C" n, C"n)=2n. Expand
On the multi-colored Ramsey numbers of cycles
TLDR
It is proved that for every integer k≥4, if n is even, then Rk(Cn)≥(k−1)n−2k+ 4, which is the smallest integer N for which for any edge-coloring of the complete graph KN by k colors there exists a color i for which the corresponding color class contains L as a subgraph. Expand
Multicolour Ramsey numbers of paths and even cycles
TLDR
R k ( C n ) ⩽ ( k − 1 4 ) n + o ( n ) is shown, obtaining the first improvement to the coefficient of the linear term by an absolute constant. Expand
New Lower Bounds on the Multicolor Ramsey Numbers Rr(C2m)
The multicolor Ramsey number Rr(H) is defined to be the smallest integer n=n(r) with the property that any r-coloring of the edges of the complete graph Kn must result in a monochromatic subgraph ofExpand
Ramsey Theory
Party Problem: Find the minimum number R(k, l) of guests that must be invited so that at least k will know each other or at least l will not know each other (we assume that if A knows B, then B knowsExpand
Recent developments in graph Ramsey theory
TLDR
There has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. Expand
Three-Color Ramsey Numbers For Paths
TLDR
It is proved that for sufficiently large n, for the three-color Ramsey numbers of paths on n vertices, the following conjecture of Faudree and Schelp is proved. Expand
The Ramsey number for a triple of long even cycles
TLDR
It is shown that for any real positive numbers @a"1,@a"2, @ a"3 the Ramsey number for a triple of even cycles of lengths is (asymptotically) equal to (@a" 1+@a’s2+@A"3+max{-o(1),-1,-2,-3}+o( 1) . Expand
A new upper bound for diagonal Ramsey numbers
We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant C such that r(k + 1,k+1) ≤ k -Clog k/log log k ( 2k k ).
...
1
2
3
...