£88.50

Proof of the 1-Factorization and Hamilton Decomposition Conjectures (Memoirs of the American Mathematical Society)

Combinatorics & Graph Theory

Price data last checked 86 day(s) ago - refreshing...

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

It has never been this cheap. We have no record of a lower price.

£89 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 5 days • 5 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 5 days • 1 price levels

Days at Price

Price Analysis

Most common price: £89 (5 days, 100.0%)

Price range: £89 - £89

Price levels: 1 different prices over 5 days

Description

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≥2⌈n/4⌉-1. Then every D-regular graph G on n vertices has a decomposition into perfect matchings. Equivalently, χ′(G)=D. (ii) [Hamilton decomposition conjecture] Suppose that D≥⌊n/2⌋. Then every D-regular graph G on n vertices has a decomposition into Hamilton cycles and at most one perfect matching. (iii) [Optimal packings of Hamilton cycles] Suppose that G is a graph on n vertices with minimum degree δ≥n/2. Then G contains at least regeven (n,δ)/2≥(n-2)/8 edge-disjoint Hamilton cycles. Here regeven (n,δ) denotes the degree of the largest even-regular spanning subgraph one can guarantee in a graph on n vertices with minimum degree δ. (i) was first explicitly stated by Chetwynd and Hilton. (ii) and the special case δ=⌈n/2⌉of (iii) answer questions of Nash-Williams from 1970. All of the above bounds are best possible.

Product Specifications

Format: paperback
ASIN: 1470420252
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Combinatorics & Graph Theory
Domain: Amazon UK
Release Date: 30 October 2016
Listed Since: 17 August 2016

Barcode

No barcode data available

Proof of the 1-Factorization and Hamilton Decomposition Conjectures (Memoirs of the American Mathematical Society)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Exercises in Graph Theory: 19 (Texts in the Mathematical Sciences, 19)

Graph Theory and Its Applications (Textbooks in Mathematics)

Graph Theory and Its Applications (Textbooks in Mathematics)

Graphs & Digraphs (Textbooks in Mathematics)

Graph Theory: 2 (Wiley Series in Discrete Mathematics and Optimization)

Graph Theory and Decomposition

Handbook of Product Graphs, Second Edition (Discrete Mathematics and Its Applications)

Random Graphs: 45 (Wiley Series in Discrete Mathematics and Optimization)

Handbook of Product Graphs (Discrete Mathematics and Its Applications)

Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (Fields Institute Monographs)

Graph Theory: 173 (Graduate Texts in Mathematics)

Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

Graph Theory: 173 (Graduate Texts in Mathematics, 173)

Topics in Algebraic Graph Theory: 102 (Encyclopedia of Mathematics and its Applications, Series Number 102)

Domination in Graphs: Core Concepts (Springer Monographs in Mathematics)

Domination in Graphs: Core Concepts (Springer Monographs in Mathematics)

Modern Graph Theory: 184 (Graduate Texts in Mathematics, 184)

Graph and Network Theory: An Applied Approach using Mathematica®: 193 (Springer Optimization and Its Applications, 193)

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms: 34 (Chapman & Hall/CRC Computer and Information Science Series)

Graph Symmetry: Algebraic Methods and Applications: 497 (Nato Science Series C:, 497)

Graph Symmetry: Algebraic Methods and Applications: 497 (Nato Science Series C:, 497)

Graph Theory: An Introduction to Proofs, Algorithms, and Applications (Textbooks in Mathematics)

Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)

Adventures in Graph Theory: A Bridge to Advanced Mathematics (Applied and Numerical Harmonic Analysis)