A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10114-011-9617-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10114-011-9617-6 / rank | |||
Normal rank | |||
Revision as of 04:01, 9 December 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
0 references
