On rainbow thresholds

DOI10.1002/RSA.21283MaRDI QIDQ7027458zbMATH OpenFDO

Authors Jie Han, Xiaofan Yuan

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/RSA.21283

zbMATH Keywords

hypergraphrandom graphthresholds

Mathematics Subject Classification ID

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

Cites work

• A proof of the Kahn–Kalai conjecture
• A smoother notion of spread hypergraphs
• Are many small sets explicitly small?
• Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
• Clutter percolation and random graphs
• Improved bounds for the sunflower lemma
• Multicolored trees in random graphs
• On rainbow Hamilton cycles in random hypergraphs
• Rainbow Hamilton cycles in random graphs and hypergraphs
• Rainbow matchings and Hamilton cycles in random graphs
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Spanning F-cycles in random graphs
• The threshold for the square of a Hamilton cycle
• Thresholds and Expectation Thresholds
• Thresholds versus fractional expectation-thresholds

This page was built for publication: On rainbow thresholds

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