Ramsey Goodness of Cycles
From MaRDI portal
Publication:5128514
DOI10.1137/18M1199125zbMath1450.05055arXiv1807.02313OpenAlexW3081600258MaRDI QIDQ5128514
Alexey Pokrovskiy, Benjamin Sudakov
Publication date: 27 October 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.02313
Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Expander graphs (05C48)
Related Items (3)
The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Ramsey numbers of cycles versus general graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey goodness of paths
- Ramsey numbers of cubes versus cliques
- Ramsey numbers involving a long path
- The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
- Ramsey goodness and beyond
- Expanding graphs contain all small trees
- Hamiltonian circuits in random graphs
- Ramsey-goodness -- and otherwise
- Spanning trees in random graphs
- Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
- Ramsey numbers for cycles in graphs
- Generalizations of a Ramsey-theoretic result of chvátal
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- On cycle—Complete graph ramsey numbers
- Ramsey Goodness of Bounded Degree Trees
- The Cycle-Complete Graph Ramsey Numbers
- Cycle-Complete Ramsey Numbers
- The Ramsey number of the clique and the hypercube
- Some remarks on the theory of graphs
This page was built for publication: Ramsey Goodness of Cycles