Pietro Majer, Matteo Novaga
Published 2009-06-09, updated 2012-02-29Version 4
We determine the probability thresholds for the existence of monotone paths, of ?finite and infi?nite 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$.
A new approach to the orientation of random hypergraphs
Configuration Models of Random Hypergraphs and their Applications
Birth of a giant $(k_1,k_2)$-core in the random digraph
![QR code for arXiv:0906.1689 [math.PR]](http://oss.arxitics.com/images/favicon.svg)