  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
Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum
number of cycles in a planar graph.
