报告题目：Spanning trees in bipartite graphs
报告人：Jun Ge，Sichuan Normal University
报告摘要：In this talk, we will introduce the electrical network method in counting spanning trees. We will obtain the number of spanning trees in complete bipartite graphs with or without some certain structures. A conjecture by Ehrenborg on a tight upper bound for the number of spanning trees of a bipartite graph will be discussed.
欢迎广大师生参加！
数理B体育
