The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345)
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: The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs |
scientific article; zbMATH DE number 6552862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs |
scientific article; zbMATH DE number 6552862 |
Statements
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (English)
0 references
9 March 2016
0 references
extremal graph theory
0 references
tree-containment problems
0 references
Loebl-Komlós-Sós conjecture
0 references
regularity lemma
0 references
sparse graphs
0 references
0 references
0 references
0.90960383
0 references
0.9093416
0 references
0.9082742
0 references
0.9077047
0 references
0.89166385
0 references
0.8792764
0 references
0.8775805
0 references
0.8742742
0 references
0.8740068
0 references
