Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
type: Item
instance of: scholarly article
title: Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
zbMATH Open document ID: 1231.05142
author: Yi Zhao
published in: The Electronic Journal of Combinatorics
publication date: 2011-02-17T00:00:00Z
full work available at URL: https://eudml.org/doc/233252
full work available at URL: v18i1p27.html
review text: 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.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 5852477
zbMATH Keywords: graphs
zbMATH Keywords: Loebl conjecture
zbMATH Keywords: subtrees
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5852477