Ramsey goodness of paths

DOI10.1016/j.jctb.2016.06.009zbMath1350.05101arXiv1512.07874OpenAlexW2963629695MaRDI QIDQ345089

Alexey Pokrovskiy, Benjamin Sudakov

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numbersexpandersRamsey goodnesspaths in graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Ramsey goodness of paths, A large tree is \(tK_m\)-good, Maximum clique deleted from Ramsey graphs of a graph and paths, The Ramsey number for a forest versus disjoint union of complete graphs, Calculating Ramsey Numbers by Partitioning Colored Graphs, Ramsey Goodness of Cycles, Ramsey Goodness of Bounded Degree Trees, Ramsey Goodness of Clique Versus Paths in Random Graphs, The extremal function for cycles of length \(\ell\) mod \(k\), 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
• Ramsey goodness of paths
• Ramsey numbers of cubes versus cliques
• On the path-complete bipartite Ramsey number
• Ramsey numbers involving a long path
• Ramsey goodness and beyond
• Multipartite graph-sparse graph Ramsey numbers
• Hamiltonian circuits in random graphs
• Ramsey-goodness -- and otherwise
• Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
• Calculating Ramsey Numbers by Partitioning Colored 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
• The Ramsey number of the clique and the hypercube
• Some remarks on the theory of graphs