Graphs with certain families of spanning trees (Q1154485): Difference between revisions

In this paper, sufficient conditions are given in terms of \(\delta(G)\) and \(\Delta(T)\), for a graph \(G\) with \(n\) vertices to contain a tree \(T\) with \(n\) vertices. One of these sufficient conditions is used to calculate some of the Ramsey numbers for the pair tree-star. Also necessary conditions are given, in terms of \(\delta(G)\), for a graph \(G\) with \(n\) vertices to contain all trees with \(n\) vertices.