The hitting time of clique factors

In a recent paper, Kahn gave the strongest possible, affirmative, answer to Shamir's problem, which had been open since the late 1970s: Let $r \ge 3 $ and let $n$ be divisible by $r$. Then, in the random $r$-uniform hypergraph process on $n$ vertices, as soon as the last isolated vertex disappe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Heckel, Annika, Kaufmann, Marc, Müller, Noela, Pasch, Matija
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Mathematics - Combinatorics Mathematics - Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!