Sciweavers

6 search results - page 2 / 2
» The order of the giant component of random hypergraphs
Sort
View
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
14 years 1 months ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...