Birth and growth of multicyclic components in random hypergraphs
type: Item
instance of: scholarly article
title: Birth and growth of multicyclic components in random hypergraphs
zbMATH Open document ID: 1198.05115
author: Vlady Ravelomanana
published in: Theoretical Computer Science
publication date: 2010-11-11T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 60K37
zbMATH DE Number: 5815222
zbMATH Keywords: random hypergraphs
zbMATH Keywords: hypergraph process
zbMATH Keywords: probabilistic/analytic combinatorics
zbMATH Keywords: asymptotic enumeration
zbMATH Keywords: extremal hypergraphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.042
OpenAlex ID: W2016314572
cites work: Local Limit Theorems for the Giant Component of Random Hypergraphs
cites work: The order of the giant component of random hypergraphs
cites work: The asymptotic number of labeled connected graphs with a given number of vertices and edges
cites work: Q3941433
cites work: Q4375247
cites work: Q3682518
cites work: Q3219268
cites work: Counting connected graphs and hypergraphs via the probabilistic method
cites work: Q3267900
cites work: Q3286850
cites work: Q5682013
cites work: Counting connected graphs asymptotically
cites work: Multicyclic components in a random graph process
cites work: Q4521552
cites work: Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
cites work: The birth of the giant component
cites work: Q4519896
cites work: Q4878665
cites work: The number of connected sparsely edged uniform hypergraphs
cites work: The phase transition in a random hypergraph
cites work: A Recurrence Related to Trees
cites work: Counting connected graphs inside-out
cites work: Another proof of Wright's inequalities
cites work: The average size of giant components between the double-jump
cites work: Component structure in the evolution of random hypergraphs
cites work: The number of connected sparsely edged graphs
cites work: The number of connected sparsely edged graphs. II. Smooth graphs and blocks
cites work: The number of connected sparsely edged graphs. III. Asymptotic results
DOI: 10.1016/J.TCS.2010.05.042
description: scientific article; zbMATH DE number 5815222