TR-2009-03

Maximum Number of Cycles and Hamiltonian Cycles in Sparse Graphs

Abstract

We mainly focus in this paper the maximum number of cycles in the union of two
trees. In order to prove non-trivial bounds we also need some upper bounds on
the number of Hamiltonian cycles in 3- and 4-regular graphs.