报告题目：Spanning trees with few leaves and branch vertices

报告简介：A leaf of a tree is a vertex with degree 1 and a branch vertex of a tree is a vertex with degree at least 3. Clearly, a hamiltonian path can be regarded as a spanning tree with exact two leaves, or a spanning tree with no branch vertex. Therefore, looking for conditions which ensure the existence of a spanning tree with bounded few leaves or (and) few branch vertices can be seen as a generalized problem of hamiltonian path problem. In this report, we give some sufficient conditions for graphs to have a spanning with few leaves or (and) few branch vertices.

报告人：蔡俊青，理学博士，2012年于兰州大学获得博士学位，师从长江学者讲座教授李皓老师，现就职于天津师范大学。主要研究领域为图的结构，尤其是图中的圈和支撑树问题。目前发表SCI论文30余篇，主持并完成国家自然科学基金青年项目等4项。2016年3月于法国巴黎萨克雷大学进行为期6个月的学术访问。

报告时间：2023年10月16日（星期一）下午 2:00-5:00

报告地点：腾讯会议，ID：848-807-955

主办单位：扬州大学数学科学学院

欢迎广大师生参加！