On the intersecting family process

DOI10.37236/12060MaRDI QIDQ6635170zbMATH OpenFDO

Authors Alan Frieze, Patrick Bennett, Andrew Newman, Wesley Pegden

Publication date 9 November 2024

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hilton-Milner-type hypergraphintersecting family of matchings of a complete graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Regular intersecting families
• Intersecting \(k\)-uniform families containing a given family
• On the maximum number of distinct intersections in an intersecting family
• On Erdős-Ko-Rado for random hypergraphs. I
• Intersecting k-uniform families containing all the k-subsets of a given set

Cites work

• A gentle introduction to the differential equation method and dynamic concentration
• A note on the random greedy independent set algorithm
• Counting intersecting and pairs of cross-intersecting families
• Differential equations for random processes and random graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• Intersecting families of discrete structures are typically trivial
• Intersecting families of sets are typically trivial
• Large independent sets in regular graphs of large girth
• On randomly generated intersecting hypergraphs
• On randomly generated non-trivially intersecting hypergraphs
• On tail probabilities for martingales
• Randomly generated intersecting hypergraphs II
• Structure and supersaturation for intersecting families

This page was built for publication: On the intersecting family process

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