Minimum degree thresholds for bipartite graph tiling (Q2888882)
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: Minimum degree thresholds for bipartite graph tiling |
scientific article; zbMATH DE number 6042702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum degree thresholds for bipartite graph tiling |
scientific article; zbMATH DE number 6042702 |
Statements
Minimum degree thresholds for bipartite graph tiling (English)
0 references
4 June 2012
0 references
graph packing
0 references
tiling
0 references
critical chromatic number
0 references
regularity lemma
0 references
blow-up lemma
0 references
0.91273445
0 references
0 references
0 references
0.8785899
0 references
0.8779397
0 references
0.8756236
0 references
0.87198526
0 references
0.86873454
0 references
