A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277)
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: A sufficient degree condition for a graph to contain all trees of size \(k\) |
scientific article; zbMATH DE number 5912874
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient degree condition for a graph to contain all trees of size \(k\) |
scientific article; zbMATH DE number 5912874 |
Statements
A sufficient degree condition for a graph to contain all trees of size \(k\) (English)
0 references
24 June 2011
0 references
Erdős-sós conjecture
0 references
0 references
