A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10114-011-9617-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061942211 / rank | |||
Normal rank | |||
Revision as of 22:09, 19 March 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
