Premium
On the Erdös‐Sós conjecture
Author(s) -
Woźniak Mariusz
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199602)21:2<229::aid-jgt13>3.0.co;2-e
Subject(s) - mathematics , combinatorics , conjecture
Erdös and Sós conjectured in 1963 that if G is a graph of order n and size e ( G ) with e ( G ) > ½ n ( k − 1), then G contains every tree T of size k . We present some partial results; in particular the proof of the conjecture in the case k = n − 3 © 1996 John Wiley & Sons, Inc.