On Ramsey numbers of hedgehogs
From MaRDI portal
Publication:5222572
DOI10.1017/S0963548319000312zbMATH Open1436.05071arXiv1902.10221OpenAlexW2980698421WikidataQ127029397 ScholiaQ127029397MaRDI QIDQ5222572FDOQ5222572
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: The hedgehog is a 3-uniform hypergraph on vertices such that, for any pair with , there exists a unique vertex such that is an edge. Conlon, Fox, and R"odl proved that the two-color Ramsey number of the hedgehog grows polynomially in the number of its vertices, while the four-color Ramsey number grows exponentially in the number of its vertices. They asked whether the two-color Ramsey number of the hedgehog is nearly linear in the number of its vertices. We answer this question affirmatively, proving that .
Full work available at URL: https://arxiv.org/abs/1902.10221
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Ramsey numbers of degenerate graphs
- Title not available (Why is that?)
- Two remarks on the Burr-Erdős conjecture
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On Ramsey Numbers of Sparse Graphs
- Hypergraph Ramsey numbers
- Partition relations for cardinal numbers
- Recent developments in graph Ramsey theory
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Hedgehogs are not colour blind
Cited In (2)
This page was built for publication: On Ramsey numbers of hedgehogs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222572)