Tiling Turán theorems (Q1586364)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tiling Turán theorems |
scientific article; zbMATH DE number 1528679
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tiling Turán theorems |
scientific article; zbMATH DE number 1528679 |
Statements
Tiling Turán theorems (English)
0 references
13 November 2000
0 references
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.
0 references
\(H\)-factor
0 references
\(H\)-matching
0 references
chromatic number
0 references
critical chromatic number
0 references
graph tiling
0 references
0.9113365
0 references
0 references
0.9064278
0 references
0 references
0 references
