A large tree is \(tK_m\)-good

DOI10.1016/j.disc.2023.113502zbMath1515.05048OpenAlexW4376881507MaRDI QIDQ6041579

Yue Jian Peng, Zhidan Luo

Publication date: 31 May 2023

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

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113502

zbMATH Keywords

Ramsey numbergoodness

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey goodness of paths
• Multipartite graph-sparse graph Ramsey numbers
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• On graphs \(G\) for which all large trees are \(G\)-good
• Ramsey-goodness -- and otherwise
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• The Ramsey number for a forest versus disjoint union of complete graphs
• Recent developments in graph Ramsey theory
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Generalizations of a Ramsey-theoretic result of chvátal
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• Ramsey Goodness of Bounded Degree Trees

This page was built for publication: A large tree is \(tK_m\)-good