On randomly generated non-trivially intersecting hypergraphs

zbMATH Open1193.05122MaRDI QIDQ2380458FDOQ2380458

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

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

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

zbMATH Keywords

intersecting hypergraphsHilton Milnor type hypergraph

Mathematics Subject Classification ID

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

Cited In (7)

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

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)