Proof of the 1-Factorization and Hamilton Decomposition Conjectures
In this paper the authors prove the following results for all sufficiently large $n$: [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$; [Hamilton decomposition conjecture] Suppose that $D \ge \lfloor n/2 \rfloor $; [Optimal packings of Hamilton cycles] Suppose that $G$ is a graph on $n$ vertices with minimum degree $\delta\ge n/2$.
CHF 125.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V106:
Fremdlagertitel. Lieferzeit unbestimmt
Produktdetails
Weitere Autoren: Kuhn, Daniela / Lo, Allan / Osthus, Deryk / Treglown, Andrew
- ISBN: 978-1-4704-2025-3
- EAN: 9781470420253
- Produktnummer: 23262776
- Verlag: American Mathematical Society
- Sprache: Englisch
- Erscheinungsjahr: 2016
- Seitenangabe: 164 S.
- Masse: H25.5 cm x B17.7 cm x D1.1 cm 260 g
- Gewicht: 260
- Sonstiges: Professional & Vocational
Bewertungen
Anmelden