Cargando…
Proof of the 1-factorization and Hamilton decomposition conjectures
In this paper the authors prove the following results (via a unified approach) for all sufficiently large n: (i) [1-factorization conjecture] Suppose that n is even and D\geq 2\lceil n/4\rceil -1. Then every D-regular graph G on n vertices has a decomposition into perfect matchings. Equivalently, \c...
| Autores principales: | , , , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
2016
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2622914 |