| Description |
1 online resource (v, 164 pages) : illustrations |
| Series |
Memoirs of the American Mathematical Society, 0065-9266 ; volume 244, number 1154 |
|
Memoirs of the American Mathematical Society ; no. 1154.
|
| Contents |
Introduction -- The two cliques case -- Exceptional systems for the two cliques case -- The bipartite case -- Approximate decompositions -- Bibliography |
| Summary |
"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-reaching generalization of Walecki's result [26] that every complete graph of odd order has a Hamilton decomposition and thirdly, a best possible result on packing edge-disjoint Hamilton cycles in Dirac graphs. The latter two problems were raised by Nash-Williams [28-30] in 1970"--Page 1 |
| Notes |
"Volume 244, Number 1154 (third of 4 numbers), November 2016." |
| Bibliography |
Includes bibliographical references (pages 163-164) |
| Notes |
Print version record |
| Subject |
Factorization (Mathematics)
|
|
Decomposition (Mathematics)
|
|
Decomposition (Mathematics)
|
|
Factorization (Mathematics)
|
| Form |
Electronic book
|
| Author |
Kuhn, Daniela, author
|
|
Lo, Allan, author
|
|
Osthus, Deryk, author
|
|
Treglown, Andrew, author
|
|
American Mathematical Society, publisher
|
| LC no. |
2016037506 |
| ISBN |
9781470435080 |
|
147043508X |
|
