Monotone paths in random hypergraphs (Q426858)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Monotone paths in random hypergraphs |
scientific article; zbMATH DE number 6045696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monotone paths in random hypergraphs |
scientific article; zbMATH DE number 6045696 |
Statements
Monotone paths in random hypergraphs (English)
0 references
12 June 2012
0 references
Summary: We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set \(\mathbb N^{[k]}\), the set of all increasing \(k\)-tuples in \(\mathbb N\). These graphs appear as line graph of uniform hypergraphs with vertex set \(\mathbb N\).
0 references
random graphs
0 references
extremal measures
0 references
percolation
0 references
