Abstract
The component structure of the most general random hypergraphs, with edges of differen sizes, is analyzed. We show that, as this is the case for random graphs, there is a "double jump" in the probable and almost sure size of the greatest component of hypergraphs, when the average vertex degree passes the value 1.
Original language | English |
---|---|
Pages (from-to) | 81-94 |
Number of pages | 14 |
Journal | Combinatorica |
Volume | 5 |
Issue number | 1 |
DOIs | |
State | Published - Mar 1985 |
Keywords
- AMS subject classification (1980): 05C65, 60C05