Bounding the number of cycles in a graph in terms of its degree sequence

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 (2009) and Arman and Tsaturian (2017) and to improve upper bounds on the maximum number of cycles in a planar graph.