On Ramsey numbers of hedgehogs

From MaRDI portal
(Redirected from Publication:5222572)




Abstract: The hedgehog Ht is a 3-uniform hypergraph on vertices such that, for any pair (i,j) with 1lei<jlet, there exists a unique vertex k>t such that i,j,k 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 Ht is nearly linear in the number of its vertices. We answer this question affirmatively, proving that r(Ht)=O(t2lnt).











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)