A large tree is tK_m-good

DOI10.1016/J.DISC.2023.113502MaRDI QIDQ6041579zbMATH OpenOpenAlexFDO

Authors Zhidan Luo, Yuejian Peng

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)

Recommendations

• On graphs \(G\) for which all large trees are \(G\)-good
• Ramsey goodness of bounded degree trees
• scientific article; zbMATH DE number 568795
• scientific article; zbMATH DE number 3885958
• Goodness of trees for generalized books

Cites work

• scientific article; zbMATH DE number 3545699 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Generalizations of a Ramsey-theoretic result of chvátal
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Multipartite graph-sparse graph Ramsey numbers
• On graphs \(G\) for which all large trees are \(G\)-good
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• Ramsey goodness of bounded degree trees
• Ramsey goodness of paths
• Ramsey-goodness -- and otherwise
• Recent developments in graph Ramsey theory
• The Ramsey number for a forest versus disjoint union of complete graphs

Cited in

(14)

• Ramsey goodness of bounded degree trees
• Goodness of trees for generalized books
• The goodness of long path with respect to multiple copies of complete graphs
• A Ramsey goodness result for graphs with large pendent trees
• Ramsey numbers of trees versus multiple copies of books
• Generalizations of a Ramsey-theoretic result of chvátal
• On graphs \(G\) for which all large trees are \(G\)-good
• On the Ramsey numbers \(r(S_n,K_6-3K_2)\)
• The Ramsey number for a linear forest versus two identical copies of complete graphs
• Trees and \(n\)-good hypergraphs
• scientific article; zbMATH DE number 3885958 (Why is no real title available?)
• Ramsey numbers of large books versus multipartite graphs
• The Ramsey number for a forest versus disjoint union of complete graphs
• scientific article; zbMATH DE number 3717360 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041579)