Cargando…

Proof of the 1-factorization and Hamilton decomposition conjectures /

"In this paper we provide a unified approach towards proving three long-standing conjectures for all sufficiently large graphs. Firstly, the 1-factorization conjecture, which can be formulated as an edge colouring problem; secondly, the Hamilton decomposition conjecture, which provides a far-re...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Csaba, Béla, 1968- (Autor), Kuhn, Daniela (Autor), Lo, Allan (Autor), Osthus, Deryk (Autor), Treglown, Andrew (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Providence, Rhode Island : American Mathematical Society, 2016.
Colección:Memoirs of the American Mathematical Society ; no. 1154.
Temas:
Acceso en línea:Texto completo

Ejemplares similares