Colloquium / Seminars

Topic：Spanning trees and continued fractions
Speaker：Prof. Swee Hong Chan
　　　　(Rutgers University)
Date time：March 31, 2026 14:00 –15:00
Venue：SA213
Abstract：
Abstract

Consider the set of positive integers representing the number of spanning trees in simple graphs with n vertices. How quickly can this set grow as a function of n? In this talk, we discuss a proof of the exponential growth of this set, which resolves an open problem of Sedlacek from 1966. The proof uses a connection with continued fractions and advances towards Zaremba’s conjecture in number theory. This is joint work with Alex Kontorovich and Igor Pak. This talk is intended for general audience.
Download：Talk_1150331.pdf

$返回$ go back