Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\) (Q625393)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5852477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\) |
scientific article; zbMATH DE number 5852477 |
Statements
Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\) (English)
0 references
17 February 2011
0 references
The author considers the \((n/2-n/2-n/2)\) conjecture which states that every \(n\)-vertex graphs with at least \(n/2\) of the vertex having degree at least \(n/2\) contains all trees with at most \(n/2\) edges as subgraphs. The article contains an exact proof of this statement for larger \(n\). As a consequence of this proof a conjecture of Burr and Erdős is partially confirmed.
0 references
graphs
0 references
Loebl conjecture
0 references
subtrees
0 references
0.8281604647636414
0 references
0.805544912815094
0 references
0.8012475967407227
0 references
0.7985970377922058
0 references
0.7962276935577393
0 references
