Projects per year
Abstract
We study the minimum degree necessary to guarantee the existence of perfect and almostperfect triangletilings in an nvertex graph G with sublinear independence number. In this setting, we show that if δ(G)≥n/3+o(n) then G has a triangletiling covering all but at most four vertices. Also, for every r≥5, we asymptotically determine the minimum degree threshold for a perfect triangletiling under the additional assumptions that G is Krfree and n is divisible by 3.
Original language  English 

Number of pages  24 
Journal  Combinatorics, Probability and Computing 
Early online date  9 May 2018 
DOIs  
Publication status  Epub ahead of print  9 May 2018 
Fingerprint
Dive into the research topics of 'Triangletilings in graphs without large independent sets'. Together they form a unique fingerprint.Projects
 1 Finished

Embeddings in hypergraphs
Engineering & Physical Science Research Council
30/03/15 → 29/03/17
Project: Research Councils