Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Graph Colouring and the Probabilistic Method

Graph Colouring and the Probabilistic Method

Molloy, Michael
Reed, Bruce

Hardcover

Series: Algorithms and Combinatorics, Book 23

Medical ReferenceGeneral MathematicsProbability & Statistics

Currently unavailable to order

ISBN10: 3540421394
ISBN13: 9783540421399
Publisher: Springer Nature
Published: Nov 20 2001
Pages: 326
Weight: 1.40
Height: 0.95 Width: 6.26 Depth: 9.38
Language: English
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.
The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and near-optimal colourings.

Also in

Medical Reference

View All