Birth and growth of multicyclic components in random hypergraphs

DOI10.1016/j.tcs.2010.05.042zbMath1198.05115OpenAlexW2016314572MaRDI QIDQ604460

Vlady Ravelomanana

Publication date: 11 November 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.042

zbMATH Keywords

asymptotic enumerationrandom hypergraphsextremal hypergraphshypergraph processprobabilistic/analytic combinatorics

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Processes in random environments (60K37)

Related Items

Phase transition of random non-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting connected graphs asymptotically
• The average size of giant components between the double-jump
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• Component structure in the evolution of random hypergraphs
• The number of connected sparsely edged uniform hypergraphs
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• Another proof of Wright's inequalities
• The order of the giant component of random hypergraphs
• The number of connected sparsely edged graphs. III. Asymptotic results
• Local Limit Theorems for the Giant Component of Random Hypergraphs
• A Recurrence Related to Trees
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• Multicyclic components in a random graph process
• The number of connected sparsely edged graphs
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• The birth of the giant component
• Counting connected graphs and hypergraphs via the probabilistic method