報告題目：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.

歡迎廣大師生參加！

數理學院