Cover of Graph Colouring and the Probabilistic Method

Science & Nature

Graph Colouring and the Probabilistic Method

Rating
–
No ratings yet.
Pages
326
2 editions
First published
2003
1 language

Overview

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. This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability.

Ratings & reviews

Log in to rate or review this book.

No written reviews yet.

Discussions

Talk about this book with other readers.

Log in to start a discussion.

No discussions yet.

Editions

  • Format not known Springer London, Limited 2013 326 pages English ISBN 9783642040160 Open Library
  • Paperback Springer 2003 326 pages ISBN 9783642040153 Open Library

Details & links

First published
2003
Pages
326
Languages
Available in 1 language

Where to buy this book: see “Buy this book”

More about this book

See it on Goodreads →

Read a sample, borrow it or see other editions → openlibrary.org