A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:58, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient degree condition for a graph to contain all trees of size \(k\) |
scientific article |
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
