Spanning structures and universality in sparse hypergraphs

In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Combin Probab Comput 9 (2000), 125–148] can be adapted from random graphs to random r‐uniform hypergraphs and provide sufficient conditions when a random r‐u...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms 2016-12, Vol.49 (4), p.819-844
Hauptverfasser:	Parczyk, Olaf, Person, Yury
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Construction Construction industry Graphs Lattices Lectures Mathematical models random hypergraphs spanning structures thresholds universality
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!