Bounds for two multicolor Ramsey numbers concerning quadrilaterals
For \(k\ge2\) given graphs \(H_1,\dots,H_k\), the \(k\)-color Ramsey number, \(R(H_1,\dots,H_k)\), is the smallest integer \(N\) such that, in any edge-coloring of \(K_N\) in \(k\) colors, there exists \(i\) such that \(1\le i\le k\) for which all edges of a copy of \(H_i\) receive color \(i\).\ \(C_m\) is the cycle of length \(m\), \(K_{1,n}\) is a point with \(n\) neighbors, and \(W_n\) is the wheel with \(n\) vertices around another vertex as the hub. Referring to Theorem 1 of their earlier paper, [Discrete Math. 342, No. 2, 285--291 (2019; Zbl 1400.05155)], the authors prove the following lower bounds for special \(n\), which two theorems imply the tightness of the earlier result; whenever we write \(C_4,\dots,C_4\) the intention is a list of \(k\) copies of \(C_4\): Theorem 6: Let \(q\) be a prime power, \(k\ge 1\) and \(n=q^2-kq\). If \(q\ge k+1\), then \(R(C_4,\dots,C_4,K_{1,n})\ge q^2\).\ Moreover, if \(q\ge \max\left\{\frac{2k^3-k^2-1}{4k},k+1\right\}\), then \(R\left(C_4,\dots,C_4,K_{1,n}\right)\ge n+\left\lceil \frac k2\sqrt{4n+k^2+2k-3}\,\right\rceil+\frac{k^2+k}2-\left\lceil\frac{k+1}2\,\right\rceil\). Theorem 7: Let \(q\) be a prime power, \(k\ge 1\) and \(n=q^2-(k-1)q+1\). If \(q\ge k-1\), then \(R(C_4,\dots,C_4,K_{1,n})\ge q^2+q+2\).\ Moreover, if \(q\ge \frac{k^3+k^2-k-1}{2k}\), then \(R\left(C_4,\dots,C_4,K_{1,n}\right)\ge n+\left\lceil \frac k2\sqrt{4n+k^2+2k-3}\,\right\rceil+\frac{k^2+k}2-k\). They extend a lower bound of \textit{S. A. Burr} et al. [Ann. Discrete Math. 41, 79--89 (1989; Zbl 0672.05063)] in Theorem 8: For any given \(k\ge 1\), \(R(C_4,\dots,C_4,K_{1,n})>n+\left\lfloor k\sqrt{n}-6kn^{\frac{11}{40}}\right\rfloor\) if \(n\) is sufficiently large. They also prove Theorem 9: For any given \(k\ge 1\), \(R(C_4,\dots,C_4,K_{1,n})=R(C_4,\dots,C_4,W_n)\) if \(n\) is sufficiently large.
- On the 3-color Ramsey numbers R(C₄,C₄,W_n)
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- On multicolor Ramsey numbers for even cycles in graphs.
- When is an Almost MonochromaticK4Guaranteed?
- Complete critical Ramsey numbers of cycle and \({K_4}\) numbers
- scientific article; zbMATH DE number 205334
- scientific article; zbMATH DE number 874213
- A remark on star-C₄ and wheel-C₄ Ramsey numbers
- Ramsey-type problem for an almost monochromatic \(K_4\)
- A remark on star-C₄ and wheel-C₄ Ramsey numbers
- A sufficient condition for all short cycles
- Generalized Ramsey theory for multiple colors
- Graph theory
- scientific article; zbMATH DE number 4099362 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- On Graphs that do not Contain a Thomsen Graph
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- Primes in short intervals
- Ramsey Graphs and Block Designs. I
- The Ramsey number R(3, t) has order of magnitude t2/log t
- The Ramsey numbers for cycles versus wheels of even order
- Über ein Problem von K. Zarankiewicz
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- Sharp bounds for some multicolour Ramsey numbers
- scientific article; zbMATH DE number 5850550 (Why is no real title available?)
- On some Ramsey numbers for quadrilaterals
- Multi-color Ramsey numbers of two bipartite graphs
- Two multicolor Ramsey numbers involving bipartite graphs
This page was built for publication: Bounds for two multicolor Ramsey numbers concerning quadrilaterals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668087)
