Abstract
It is shown that the Ramsey number \(r(C_{2m+1},C_{2m+1},K_t)\) is between \(\Omega \Big (t^{1+\frac{2}{2m-1}}/(\log t)^{\frac{4}{2m-1}}\Big )\) and \(O\Big (t^{\big (1+\frac{1}{m}\big )^2}/(\log t)^{\frac{2m+1}{m^2}}\Big )\) for fixed m and large t.
Similar content being viewed by others
Availability of Data and Material
There are none used.
References
Alon, N., Kahale, N.: Approximating the independence number via the \(\vartheta \)-function. Math. Programm. 80, 253–264 (1998)
Alon, N., Rödl, V.: Sharp bounds for some multicolor Ramsey numbers. Combinatorica 25, 125–141 (2005)
Chung, F., Graham, R.: Erdős on Graphs: His Legacy of Unsolved Problems. A. K Peters Ltd, Peters Ltd, Wellesley, (1998)
Erdős, P., Sós, V.: Problems and results on Ramsey-Turán type theorems. In: Proceedings of of the West Coast Conference on Combinatorics, Graph Theory and Computing, Humboldt State University, Arcata, CA, 1979, Congressus Numer. Vol. XXVI, Utilitas Mathematics, Winnipeg, Man. pp. 17–23 (1980)
He, X., Wigderson, Y.: Multicolor Ramsey numbers via pseudorandom graphs. Electron. J. Combin. 27, 1 (2020)
Krivelevich, M., Sudakov, B.: Pseudo-Random Graphs. More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol. 15, pp. 199–262. Springer, Berlin (2006)
Li, Y., Zang, W.: The independence number of graphs with a forbidden cycle and Ramsey numbers. J. Comb. Optim. 7, 353–359 (2003)
Nilli, A.: On the second eigenvalue of a graph. Discret. Math. 91, 207–210 (1991)
Nilli, A.: Tight estimates for eigenvalues of regular graphs. Electron. J. Combin. 11, 1 (2004)
Sawin, W.: An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem. J. Combin. Theory Ser. A. 188, 105579 (2022)
Simonovits, M., Sós, V.: Ramsey–Turán theory. Discret. Math. 229, 293–340 (2001)
Sudakov, B.: A note on odd cycle-complete graph Ramsey numbers. Electron. J. Combin. 9, 1 (2002)
Wigderson, Y.: An improved lower bound on multicolor Ramsey numbers. Proc. Am. Math. Soc. 149, 2371–2374 (2021)
Xu, Z., Ge, G.: A note on multicolor Ramsey number of small odd cycles versus a large clique. Discret. Math. 345, 112823 (2022)
Acknowledgements
We are grateful to Professor Schiermeyer and reviewers for their valuable comments and suggestions which improve the presentations of the results greatly.
Funding
Supported in part by NSFC (11871377, 11901001, 11931002).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There are none.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Liu, M., Li, Y. Ramsey Numbers Involving an Odd Cycle and Large Complete Graphs in Three Colors. Graphs and Combinatorics 38, 182 (2022). https://doi.org/10.1007/s00373-022-02577-w
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-022-02577-w