Ramsey numbers for multiple copies of sparse graphs
From MaRDI portal
Publication:6565813
DOI10.1002/JGT.23100zbMATH Open1542.0511MaRDI QIDQ6565813FDOQ6565813
Authors: Aurelio Sulser, Miloš Trujić 
Publication date: 2 July 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Spanning trees in random graphs
- Some remarks on the theory of graphs
- Title not available (Why is that?)
- Ramsey's theorem - a new lower bound
- A new upper bound for diagonal Ramsey numbers
- Ramsey Theorems for Multiple Copies of Graphs
- A new upper bound for the bipartite Ramsey problem
- Ramsey numbers of degenerate graphs
- Dependent random choice
- On two problems in graph Ramsey theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On graphs with linear Ramsey numbers
- A conjecture of Erdős on graph Ramsey numbers
- On bipartite graphs with linear Ramsey numbers
- The Ramsey number of a graph with bounded maximum degree
- Density theorems for bipartite graphs and related Ramsey-type results
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Two remarks on the Burr-Erdős conjecture
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recent developments in graph Ramsey theory
- On a problem of formal logic.
- A proof of the Erdős-Faber-Lovász conjecture
- On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
- Diagonal Ramsey via effective quasirandomness
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- A proof of Ringel's conjecture
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)
