Loose paths in random ordered hypergraphs
Discrete Applied Mathematics · 2026-08 · 389 · 267-279
DOI: 10.1016/j.dam.2026.04.020 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-08. Verfasst von Andrzej Dudek und 2 weiteren Autor:innen. Die Arbeit nennt 5 Literaturangaben. Gefördert von: Simons Foundation, National Science Foundation Directorate for Mathematical and Physical Sciences.
Abstract (Originalsprache)
We consider the length of {\em ordered loose paths} in the random $r$-uniform hypergraph $H=H^{(r)}(n, p)$. A ordered loose path is a sequence of edges $E_1,E_2,\ldots,E_\ell$ where $\max\{j\in E_i\}=\min\{j\in E_{i+1}\}$ for $1\leq i
Förderung
- Simons Foundation
- National Science Foundation Directorate for Mathematical and Physical Sciences
Zitieren
APA
Dudek, A., Frieze, A., & Pegden, W. (2026). Loose paths in random ordered hypergraphs. Discrete Applied Mathematics, 389, 267-279. https://doi.org/10.1016/j.dam.2026.04.020
Vancouver
Dudek A, Frieze A, Pegden W. Loose paths in random ordered hypergraphs. Discrete Applied Mathematics. 2026;389:267-279. doi:10.1016/j.dam.2026.04.020
BibTeX
@article{Dudek2026,
author = {Dudek, Andrzej and Frieze, Alan and Pegden, Wesley},
title = {Loose paths in random ordered hypergraphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {389},
pages = {267--279},
doi = {10.1016/j.dam.2026.04.020}
}
EUVIMED