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...

Full description

Saved in:

Bibliographic Details
Published in:	Random structures & algorithms Vol. 58; no. 3; pp. 480 - 516
Main Authors:	Han, Jie, Morris, Patrick, Treglown, Andrew
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.05.2021 Wiley Subscription Services, Inc
Subjects:	Apexes clique tilings Graph theory Graphs Intervals random graphs randomly perturbed structures Tiling
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!