Ramsey numbers involving an odd cycle and large complete graphs in three colors

DOI10.1007/s00373-022-02577-wzbMath1502.05159OpenAlexW4308113488MaRDI QIDQ2093110

Meng Liu, Yusheng Li

Publication date: 4 November 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02577-w

zbMATH Keywords

Ramsey numbercomplete graphodd cycle

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the second eigenvalue of a graph
• Approximating the independence number via the \(\vartheta\)-function
• The independence number of graphs with a forbidden cycle and Ramsey numbers
• Tight estimates for eigenvalues of regular graphs
• An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
• A note on multicolor Ramsey number of small odd cycles versus a large clique
• Multicolor Ramsey numbers via pseudorandom graphs
• Sharp bounds for some multicolour Ramsey numbers
• An improved lower bound on multicolor Ramsey numbers
• Ramsey-Turán theory
• A note on odd cycle-complete graph Ramsey numbers

This page was built for publication: Ramsey numbers involving an odd cycle and large complete graphs in three colors