Tiling Turán theorems
type: Item
instance of: scholarly article
title: Tiling Turán theorems
zbMATH Open document ID: 0949.05063
author: János Komlós
published in: Combinatorica
publication date: 2000-11-13T00:00:00Z
review text: Given a graph \(H\), \(\text{TT}(n,H,M)\) is the least minimum degree of an \(n\)-vertex graph \(G\) which ensures that vertex disjoint copies of \(H\) can be embedded in a large graph \(G\), having in all \(M\) vertices. The author proves a formula for the limit over \(n\) of \(\frac{1}{n} \text{TT}(n,H,xn)\) in terms of \(x\), which involves only the chromatic number and a refinement, the critical chromatic number.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1528679
zbMATH Keywords: \(H\)-factor
zbMATH Keywords: \(H\)-matching
zbMATH Keywords: chromatic number
zbMATH Keywords: critical chromatic number
zbMATH Keywords: graph tiling
reviewed by: Ki Hang Kim
MaRDI profile type: Publication
full work available at URL: s004930070020
OpenAlex ID: W1971539651
DOI: 10.1007/S004930070020
Recommended article: Tilings of the plane and Thurston semi-norm
Recommended article: Proof of a tiling conjecture of Komlós
Recommended article: Fixed point theorems and tiling problems
Recommended article: Q5057072
Recommended article: Tilings in topological spaces
Recommended article: Q4218763
Recommended article: Q3569522
Recommended article: Q4501557
Recommended article: Tilings: recursivity and regularity
Recommended article: Q3685598
description: scientific article; zbMATH DE number 1528679