Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2013

A bound on the number of perfect matchings in Klee-graphs

Résumé

The famous conjecture of Lovász and Plummer, very recently proven by Esperet et al. (2011), asserts that every cubic bridgeless graph has exponentially many perfect matchings. In this paper we improve the bound of Esperet et al. for a specific subclass of cubic bridgeless graphs called the Klee-graphs. We show that every Klee-graph with n ≥8 vertices has at least 3 *2(n+12)/60 perfect matchings.

Fichier principal
Vignette du fichier
1696-7669-1-PB.pdf (318.84 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00990605 , version 1 (13-05-2014)

Licence

Identifiants

Citer

Marek Cygan, Marcin Pilipczuk, Riste Škrekovski. A bound on the number of perfect matchings in Klee-graphs. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 1 (1), pp.37--52. ⟨10.46298/dmtcs.633⟩. ⟨hal-00990605⟩

Collections

190 Consultations
2514 Téléchargements

Altmetric

Partager

  • More