A median-type condition for graph tiling
Combinatorics
2018-12-21 v2
Abstract
Komlos [Tiling Turan theorems, Combinatorica, 20,2 (2000), 203{218] determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph. We show that the minimum degree condition can be relaxed in the sense that we require only a given fraction of vertices to have the prescribed degree.
Keywords
Cite
@article{arxiv.1805.03507,
title = {A median-type condition for graph tiling},
author = {Diana Piguet and Maria Saumell},
journal= {arXiv preprint arXiv:1805.03507},
year = {2018}
}
Comments
13 pages, 1 figure, accepted to the European Journal of Combinatorics