6 search results - page 2 / 2 » The order of the giant component of random hypergraphs |
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
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...