Counting Hamiltonian Cycles in the Matroid Basis Graph
Résumé
We present superfactorial and exponential lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graph of generalized Catalan, uniform, and graphic matroids. All lower bounds were obtained by a common general strategy based on counting appropriated cycles of length four in the corresponding matroid basis graph.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...