Ramsey Goodness of Bounded Degree Trees

DOI10.1017/S0963548317000554zbMath1388.05120arXiv1611.02688OpenAlexW2963974761MaRDI QIDQ4635503

Alexey Pokrovskiy, Igor Balla, Benjamin Sudakov

Publication date: 23 April 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55)

Related Items

Ramsey goodness of paths, A large tree is \(tK_m\)-good, The Ramsey number for a forest versus disjoint union of complete graphs, Ramsey Goodness of Cycles, On the Size-Ramsey Number of Cycles, The multicolor size-Ramsey numbers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey goodness of paths
• Ramsey numbers of cubes versus cliques
• Ramsey goodness and beyond
• Multipartite graph-sparse graph Ramsey numbers
• Expanding graphs contain all small trees
• Ramsey-goodness -- and otherwise
• Tree embeddings
• Embedding Spanning Trees in Random Graphs
• Generalizations of a Ramsey-theoretic result of chvátal
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• The Cycle-Complete Graph Ramsey Numbers
• The History of Degenerate (Bipartite) Extremal Graph Problems
• The Ramsey number of the clique and the hypercube
• Some remarks on the theory of graphs