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

NOVAGA, MATTEO
2012

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.
2012
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2501542
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
  • OpenAlex ND
social impact