Speaker: Hu Zhiquan, Professor, doctoral supervisor at Central China Normal University

Date: April 13, 2023

Time: 9:30-10:30

Location: Tencent Meeting

Sponsor: School of Mathematics, Shandong University

Abstract:

In this talk, we show some results of spanning trees with a bounded number of leaves in a graph. In particular, we prove that it is a 2-connected-free graph with, then it contains a spanning tree with at most leaves, where and are two integers with. Examples show that the upper bound is sharp.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/176972.htm