A smoother notion of spread hypergraphs

DOI10.1017/S0963548323000202MaRDI QIDQ6632778zbMATH OpenFDO

Authors Sam Spiro

Publication date 5 November 2024

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548323000202

zbMATH Keywords

spreadthresholdshypergraphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4139802
• Spread approximations for forbidden intersections problems
• Quasi-random hypergraphs
• On offset Hamilton cycles in random hypergraphs
• Quasirandomness in hypergraphs

Cites work

• Factors in random graphs
• Improved bounds for the sunflower lemma
• The probabilistic method
• The threshold for the square of a Hamilton cycle
• Thresholds versus fractional expectation-thresholds

Cited in

(3)

• On rainbow thresholds
• Rainbow thresholds
• Searching for (sharp) thresholds in random structures: where are we now?

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 Q6632778)