Paths, cycles and sprinkling in random hypergraphs

arXiv2103.16527MaRDI QIDQ6364142FDOQ6364142

Authors: Oliver Cooley 

Publication date: 30 March 2021

Abstract: We prove a lower bound on the length of the longest $j$-tight cycle in a $k$-uniform binomial random hypergraph for any $2lejlek-1$. We first prove the existence of a $j$-tight path of the required length. The standard "sprinkling" argument is not enough to show that this path can be closed to a $j$-tight cycle -- we therefore show that the path has many extensions, which is sufficient to allow the sprinkling to close the cycle.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Hypergraphs (05C65)

This page was built for publication: Paths, cycles and sprinkling in random hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364142)