Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu

A perfect Kr‐tiling in a graph G is a collection of vertex‐disjoint copies of Kr that together cover all the vertices in G. In this paper we consider perfect Kr‐tilings in the setting of randomly perturbed graphs; a model introduced by Bohman, Frieze, and Martin [7] where one starts with a dense gra...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 58; číslo 3; s. 480 - 516
Hlavní autori:	Han, Jie, Morris, Patrick, Treglown, Andrew
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.05.2021 Wiley Subscription Services, Inc
Predmet:	Apexes clique tilings Graph theory Graphs Intervals random graphs randomly perturbed structures Tiling
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!