Colloquium / Seminars
Topic:Embedded graphs, Eulerian digraphs, and their Jacobian groups
Speaker:Prof. Donggyu Kim
(Hanyang University)Date time:Oct. 13, 2026 14:00 - 15:00
Venue:SA213
Abstract:
Abstract. The celebrated Kirchhoff matrix-tree theorem connects a combinatorial quantity---the number of spanning trees of a graph---with an algebraic one---the determinant of its reduced Laplacian matrix. This theorem has analogues for Eulerian digraphs and embedded graphs, where determinants of certain matrices count Eulerian tours and quasi-trees, respectively. We will explore the interplay between these two settings and see how the corresponding matrices lead to Jacobian groups that naturally act on Eulerian tours and quasi-trees.Download:Talk_1151013.pdf
go back

