Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
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.
scientific article; zbMATH DE number 5852477