报告人：樊丹丹 讲师
报告题目：Spectral radius and edge-disjoint spanning trees of graphs with prescribed edge connectivity
报告时间：2026年6月8日（周一）下午14:30
报告地点：腾讯会议：537764142
主办单位：数学与统计学院、数学研究院、科学技术研究院
报告人简介：
樊丹丹，新疆农业大学，讲师，2024年6月博士毕业于华东理工大学，研究方向是图谱理论。主持国家自然科学基金青年基金及自治区自然科学基金青年基金各一项。近5年来，在《Journal of Graph Theory》、《European Journal of Combinatorics》、《Electron. J. Combin.》等SCI源期刊上发表学术论文20余篇。
报告摘要：
The spanning tree packing number of a graph $G$, denoted by $\tau(G)$, is the maximum number of edge-disjoint spanning trees contained in $G$. The study of $\tau(G)$ is one of the classic problems in graph theory. A famous theorem of Tutte and Nash-Williams implies that the edge connectivity $\kappa'(G)$ and $\tau(G)$ are closely related with $\tau(G)\ge \lfloor \tfrac{\kappa'(G)}{2}\rfloor$. Therefore, it is interesting to explore conditions on a graph $G$ with $\kappa'(G)\le 2k-1$ to ensure $\tau(G)\ge k$. In this talk, we establish spectral radius conditions to ensure $\tau(G)\geq k$ in $k$-edge-connected graphs with fixed minimum degree.
