Ramsey numbers for multiple copies of sparse graphs

DOI10.1002/JGT.23100MaRDI QIDQ6565813zbMATH OpenFDO

Authors Aurelio Sulser, Miloš Trujić

Publication date 2 July 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23100

zbMATH Keywords

absorbing methoddisjoint unionRamsey theorysparse graphs

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• Ramsey goodness and beyond
• On the Ramsey number of sparse 3-graphs
• Ramsey numbers of sparse hypergraphs
• Ramsey number of multiple copies of stars

Cites work

• A conjecture of Erdős on graph Ramsey numbers
• A new upper bound for diagonal Ramsey numbers
• A new upper bound for the bipartite Ramsey problem
• A proof of Ringel's conjecture
• A proof of the Erdős-Faber-Lovász conjecture
• Density theorems for bipartite graphs and related Ramsey-type results
• Dependent random choice
• Diagonal Ramsey via effective quasirandomness
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• scientific article; zbMATH DE number 3869331 (Why is no real title available?)
• scientific article; zbMATH DE number 3494449 (Why is no real title available?)
• scientific article; zbMATH DE number 3506748 (Why is no real title available?)
• scientific article; zbMATH DE number 1317271 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Lower bounds of tower type for Szemerédi's uniformity lemma
• On a problem of formal logic.
• On bipartite graphs with linear Ramsey numbers
• On graphs with linear Ramsey numbers
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• On two problems in graph Ramsey theory
• Ramsey numbers of degenerate graphs
• Ramsey Theorems for Multiple Copies of Graphs
• Ramsey's theorem - a new lower bound
• Recent developments in graph Ramsey theory
• Some remarks on the theory of graphs
• Spanning trees in random graphs
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• The Ramsey number of a graph with bounded maximum degree
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• Two remarks on the Burr-Erdős conjecture

Cited in

(2)

• Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes
• Ramsey numbers of generalized fans versus multiple cliques

This page was built for publication: Ramsey numbers for multiple copies of sparse graphs

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