Ramsey numbers of cycles versus general graphs

DOI10.1017/fms.2023.6OpenAlexW4321230076MaRDI QIDQ5878545

John Haslegrave, Hong Liu, Joseph Hyde, Jae-Hoon Kim

Publication date: 21 February 2023

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

zbMATH Keywords

Allen-Brightwell-Skokan conjecturelarge chromatic number

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55) Expander graphs (05C48)

Related Items (3)

Disjoint isomorphic balanced clique subdivisions ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey goodness of paths
• The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
• The size Ramsey number
• Proof of Komlós's conjecture on Hamiltonian subsets
• Ramsey-goodness -- and otherwise
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Ramsey numbers for cycles in graphs
• Recent developments in graph Ramsey theory
• Generalizations of a Ramsey-theoretic result of chvátal
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• The Cycle-Complete Graph Ramsey Numbers
• Cycle-Complete Ramsey Numbers
• Extremal density for sparse minors and subdivisions
• Ramsey Goodness of Cycles
• Ramsey Goodness of Clique Versus Paths in Random Graphs
• A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
• Some remarks on the theory of graphs
• Ramsey Numbers Involving Large Books
• The chromatic number of random graphs

This page was built for publication: Ramsey numbers of cycles versus general graphs