A note on multicolor Ramsey number of small odd cycles versus a large clique

DOI10.1016/j.disc.2022.112823zbMath1486.05198arXiv2110.09799OpenAlexW4225726351WikidataQ114190553 ScholiaQ114190553MaRDI QIDQ2124616

Zixiang Xu, Gennian Ge

Publication date: 11 April 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.09799

zbMATH Keywords

odd cyclesmulticolor Ramsey problems

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• The early evolution of the \(H\)-free process
• A note on Ramsey numbers
• Ramsey's theorem - a new lower bound
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Some combinatorial and geometric characterizations of the finite dual classical generalized hexagons
• The independence number of graphs with a forbidden cycle and Ramsey numbers
• An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
• Lower bounds for multicolor Ramsey numbers
• Sharp bounds for some multicolour Ramsey numbers
• Recent developments in graph Ramsey theory
• An Introduction to Incidence Geometry
• On cycle—Complete graph ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• An improved lower bound on multicolor Ramsey numbers
• Cycle-Complete Ramsey Numbers
• Some remarks on the theory of graphs
• A note on odd cycle-complete graph Ramsey numbers

This page was built for publication: A note on multicolor Ramsey number of small odd cycles versus a large clique