Randomly generated intersecting hypergraphs II

DOI10.1002/rsa.20152zbMath1108.05087DBLPjournals/rsa/BohmanFMRS07arXiv1605.07607OpenAlexW2949527520WikidataQ57401495 ScholiaQ57401495MaRDI QIDQ3419609

Cliff Smyth, Ryan R. Martin, Tom Bohman, Miklós Ruszinkó, Alan M. Frieze

Publication date: 7 February 2007

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

Full work available at URL: https://arxiv.org/abs/1605.07607

zbMATH Keywords

intersecting hypergraphsgraph functionalsonline processes

Mathematics Subject Classification ID

Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

Erdős–Ko–Rado in Random Hypergraphs ⋮ On the Random Satisfiable Process

Cites Work

• G-Intersecting Families
• On the size of a random maximal graph

This page was built for publication: Randomly generated intersecting hypergraphs II