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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3494449 (Why is no real title available?)
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Hedgehogs are not colour blind
- Hypergraph Ramsey numbers
- On Ramsey Numbers of Sparse Graphs
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Partition relations for cardinal numbers
- Ramsey numbers of degenerate graphs
- Recent developments in graph Ramsey theory
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Two remarks on the Burr-Erdős conjecture
Cited in
(3)
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)