Sufficient conditions are given in terms of δ(G) and Δ(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 δ(G), for a graph G with n vertices to contain all trees with n vertices.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics