Triangle-tilings in graphs without large independent sets
Research output: Contribution to journal › Article › peer-review
Authors
Colleges, School and Institutes
External organisations
- Department of Mathematics, University of Illinois at Urbana-Champaign
- University of South Florida
Abstract
We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an n-vertex graph G with sublinear independence number. In this setting, we show that if δ(G)≥n/3+o(n) then G has a triangle-tiling covering all but at most four vertices. Also, for every r≥5, we asymptotically determine the minimum degree threshold for a perfect triangle-tiling under the additional assumptions that G is Kr-free and n is divisible by 3.
Details
Original language | English |
---|---|
Number of pages | 24 |
Journal | Combinatorics, Probability and Computing |
Early online date | 9 May 2018 |
Publication status | E-pub ahead of print - 9 May 2018 |