Abstract:Let [Formula: see text] be a graph of order [Formula: see text] and [Formula: see text] an integer not great than [Formula: see text]. Erdős and Sós conjectured that if [Formula: see text] has at least [Formula: see text] edges, then [Formula: see text] contains all trees of order [Formula: see text]. Loebl, Komlós and Sós conjectured that if at least [Formula: see text] vertices of [Formula: see text] have degree at least [Formula: see text], then [Formula: see text] contains all trees of order [Formula: see … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.