Author:
BALOGH JÓZSEF,TREGLOWN ANDREW,WAGNER ADAM ZSOLT
Abstract
A perfect H-tiling in a graph G is a collection of vertex-disjoint copies of a graph H in G that together cover all the vertices in G. In this paper we investigate perfect H-tilings in a random graph model introduced by Bohman, Frieze and Martin [6] in which one starts with a dense graph and then adds m random edges to it. Specifically, for any fixed graph H, we determine the number of random edges required to add to an arbitrary graph of linear minimum degree in order to ensure the resulting graph contains a perfect H-tiling with high probability. Our proof utilizes Szemerédi's Regularity Lemma [29] as well as a special case of a result of Komlós [18] concerning almost perfect H-tilings in dense graphs.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference30 articles.
1. Treglown A. (2007) The regularity lemma and applications to packings in graphs. MSc thesis, University of Birmingham.
2. Hamiltonian circuits in random graphs
3. McDowell A. and Mycroft R. Hamilton ℓ-cycles in randomly perturbed hypergraphs. Submitted.
4. Tree-Matchings in Graph Processes
5. The minimum degree threshold for perfect graph packings
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献