報告人：樊丹丹 講師
報告題目：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.