A Smoother Notion of Spread Hypergraphs

arXiv2106.11882MaRDI QIDQ6370975FDOQ6370975

Publication date: 22 June 2021

Abstract: Alweiss, Lovett, Wu, and Zhang introduced

q

-spread hypergraphs in their breakthrough work regarding the sunflower conjecture, and since then

q

-spread hypergraphs have been used to give short proofs of several outstanding problems in probabilistic combinatorics. A variant of

q

-spread hypergraphs was implicitly used by Kahn, Narayanan, and Park to determine the threshold for when a square of a Hamiltonian cycle appears in the random graph

G_{n, p}

. In this paper we give a common generalization of the original notion of

q

-spread hypergraphs and the variant used by Kahn et al.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

This page was built for publication: A Smoother Notion of Spread Hypergraphs

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