Speaker: Zdenek Dvorak
Title: Degree sequence and the number of cycles
Abstract:
We give an upper bound on the number of cycles in a simple graph in terms of its degree
sequence, and apply this bound to resolve several conjectures of Kiraly and of
and Arman and Tsaturian regarding number of cycles in graphs with a given number of edges
or average degree, and to improve upper bounds on the maximum number of cycles in a planar graph.
This is joint work with  N. Morrison, J. Noel, S. Norin, and L. Postle.