We survey some recent results on bounds on the minimum and maximum degree of graph that ensure it contains all trees of a fixed size, and corresponding results for digraphs. We also present a number of conjectures and open questions.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Degree Conditions for Trees in Undirected and Directed Graphs

  • Maya Stein

摘要

We survey some recent results on bounds on the minimum and maximum degree of graph that ensure it contains all trees of a fixed size, and corresponding results for digraphs. We also present a number of conjectures and open questions.