On the Multi-Colored Ramsey Numbers of Paths and Even Cycles

@article{Srkzy2016OnTM,
  title={On the Multi-Colored Ramsey Numbers of Paths and Even Cycles},
  author={G{\'a}bor N. S{\'a}rk{\"o}zy},
  journal={Electron. J. Comb.},
  year={2016},
  volume={23},
  pages={3}
}
In this paper we improve the upper bound on the multi-color Ramsey numbers of paths and even cycles. More precisely, we prove the following. For every $r\geq 2$ there exists an $n_0=n_0(r)$ such that for $n\geq n_0$ we have $$R_r(P_n) \leq \left( r - \frac{r}{16r^3+1} \right) n.$$ For every $r\geq 2$ and even $n$ we have $$R_r(C_n) \leq \left( r - \frac{r}{16r^3+1} \right) n + o(n) \text{ as }n\rightarrow \infty.$$ The main tool is a stability version of the Erdős-Gallai theorem that may be of… 
On some Multicolor Ramsey Properties of Random Graphs
TLDR
It is shown that $5n/2-15/2 \le \hat{R}(P_n) \le 74n$ for $n$ sufficiently large, which improves the previous lower bound and improves the upper bound.
Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles
TLDR
The upper bound of R_k(P_n) is improved to $(k - \frac{1}{2}+ o(1))n) and structural insights in connected graphs without a large matching are used.
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 graph
Constructive Ramsey Numbers for Loose Hyperpaths
For positive integers k and \(\ell \), a k-uniform hypergraph is called a loose path of length \(\ell \), and denoted by \(P_\ell ^{(k)}\), if its vertex set is \(\{v_1, v_2, \ldots , v_{(k-1)\ell
Monochromatic loose paths in multicolored k-uniform cliques
TLDR
There is an algorithm such that for every $r$-edge-coloring of the edges of the complete $k$-uniform hypergraph, it finds a monochromatic copy of P_\ell^{(k)}$ in time at most $cn^k$.
Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
A graph H = (W,EH) is said to have bandwidth at most b if there exists a labeling of W as w1, w2, . . . , wn such that |i−j| ≤ b for every edge wiwj ∈ EH. We say H is a balanced (β,∆)graph if it is a
Multicolour Ramsey numbers of paths and even cycles
On Path Convex Ramsey Numbers
In this article, we will first find the path convex Ramsey numbers for two‐colorings. Then using this, we will deduce some bounds for path convex Ramsey numbers for multicolorings. Next, we will find
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
A matching M $M$ in a graph G $G$ is connected if all the edges of M $M$ are in the same component of G $G$ . Following Łuczak, there have been many results using the existence of large connected
Bipartite Ramsey Numbers of Cycles for Random Graphs
TLDR
For graphs G and H, G → k H signify that any k -edge coloring of G contains a monochromatic H as a subgraph.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
On Three-Color Ramsey Number of Paths
TLDR
This paper shows that if (n,m)≠(3,3), (3,4) and m≥n, then R(P_3,P_n, P_m) = 2m+n-1, and R (P3,mK2,nK2) =2m-1 for $$m\ge n\ge 3$$m≥ n≥3.
The 3-colored Ramsey number of even cycles
The 3-colored Ramsey number of odd cycles
ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS
In 1940 TURIN raised the following question: if the number of nodes, n, of a graph’ is prescribed and if I is an integer cs n, what is the number of edges which the graph has to contain in order to
Path Ramsey numbers in multicolorings
The Ramsey number for a triple of long even cycles
On Ramsey-Type Problems
In this paper, we give a brief survey on four problems of Ramsey-type. The first and second problems are concerned about a sequence of numbers. The third one appears in discrete geometry and the
Small Ramsey Numbers
We present data which, to the best of our knowledge, includes all known nontrivial values and bounds for specific graph, hypergraph and multicolor Ramsey numbers, where the avoided graphs are
Regular Partitions of Graphs
Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph
R(Cn, Cn, Cn)<=(4+o(1)) n
  • T. Luczak
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1999
TLDR
It is shown that the value of R(Cn, Cn , Cn ; Cn) does not grow with n much faster than 4n, and this problem is not able to settle.
...
...