We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set N[k], the set of all increasing k-tuples in N. These graphs appear as line graph of uniform hypergraphs with vertex set N.
Monotone paths in random hypergraphs
MAJER, PIETRO;NOVAGA, MATTEO
2012-01-01
Abstract
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set N[k], the set of all increasing k-tuples in N. These graphs appear as line graph of uniform hypergraphs with vertex set N.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
