A large tree is tK_m-good
From MaRDI portal
Publication:6041579
DOI10.1016/J.DISC.2023.113502zbMATH Open1515.05048OpenAlexW4376881507MaRDI QIDQ6041579FDOQ6041579
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
Recommendations
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Title not available (Why is that?)
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- Title not available (Why is that?)
- Ramsey-goodness -- and otherwise
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Multipartite graph-sparse graph Ramsey numbers
- Ramsey goodness of paths
- Generalizations of a Ramsey-theoretic result of chvátal
- Ramsey goodness of bounded degree trees
- Recent developments in graph Ramsey theory
- 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
- The Ramsey number for a forest versus disjoint union of complete graphs
Cited In (14)
- Goodness of trees for generalized books
- The goodness of long path with respect to multiple copies of complete graphs
- Ramsey numbers of trees versus multiple copies of books
- A Ramsey goodness result for graphs with large pendent trees
- 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
- Title not available (Why is that?)
- Ramsey numbers of large books versus multipartite graphs
- The Ramsey number for a forest versus disjoint union of complete graphs
- Title not available (Why is that?)
- Ramsey goodness of bounded degree trees
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)