A Precise Threshold for Quasi-Ramsey Numbers
From MaRDI portal
Publication:2947436
DOI10.1137/14097313XzbMath1321.05157arXiv1403.3464MaRDI QIDQ2947436
Guus Regts, János Pach, Ross J. Kang, Viresh Patel
Publication date: 23 September 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3464
Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (2)
On a Ramsey-type problem of Erdős and Pach ⋮ The Erdős-Hajnal conjecture for three colors and triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a Ramsey-type problem of Erdős and Pach
- A new upper bound for diagonal Ramsey numbers
- Ramsey's theorem - a new lower bound
- The t-Improper Chromatic Number of Random Graphs
- On a Quasi‐Ramsey problem
- On subgraphs without large components
- Some remarks on the theory of graphs
This page was built for publication: A Precise Threshold for Quasi-Ramsey Numbers