A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C07 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5912874 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Erdős-sós conjecture | |||
| Property / zbMATH Keywords: Erdős-sós conjecture / rank | |||
Normal rank | |||
Revision as of 12:31, 1 July 2023
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
