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$.
@article{10_37236_2180,
author = {Matteo Novaga and Pietro Majer},
title = {Monotone paths in random hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {2},
doi = {10.37236/2180},
zbl = {1244.05205},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2180/}
}
TY - JOUR
AU - Matteo Novaga
AU - Pietro Majer
TI - Monotone paths in random hypergraphs
JO - The electronic journal of combinatorics
PY - 2012
VL - 19
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/2180/
DO - 10.37236/2180
ID - 10_37236_2180
ER -
%0 Journal Article
%A Matteo Novaga
%A Pietro Majer
%T Monotone paths in random hypergraphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2180/
%R 10.37236/2180
%F 10_37236_2180
Matteo Novaga; Pietro Majer. Monotone paths in random hypergraphs. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2180
