On randomly generated non-trivially intersecting hypergraphs

MaRDI QIDQ2380458zbMATH OpenFDO

Authors Balázs Patkós

Publication date 26 March 2010

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

Full work available at URL https://eudml.org/doc/233815, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r26.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Hilton Milnor type hypergraphintersecting hypergraphs

Mathematics Subject Classification ID

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

Review text

Summary: We propose two procedures to choose members of \(\binom{[n]}{r}\) sequentially at random to form a non-trivially intersecting hypergraph. In both cases we show what is the limiting probability that if \(r = c_n n^{1/3}\) with \(c_n \rightarrow c\), then the process results in a Hilton-Milner-type hypergraph.

Recommendations

• On randomly generated intersecting hypergraphs
• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
• Randomly generated intersecting hypergraphs II
• Erdős-Ko-Rado in random hypergraphs
• Intersections of random hypergraphs and tournaments

Cited in

(7)

• On randomly generated intersecting hypergraphs
• Randomly generated intersecting hypergraphs II
• Generating Random Hyperbolic Graphs in Subquadratic Time
• Intersections of random hypergraphs and tournaments
• Nonintersecting Ryser Hypergraphs
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• On the intersecting family process

This page was built for publication: On randomly generated non-trivially intersecting hypergraphs

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