Logo - springer
Slogan - springer

Mathematics - Probability Theory and Stochastic Processes | Graph Colouring and the Probabilistic Method

Graph Colouring and the Probabilistic Method

Series: Algorithms and Combinatorics, Vol. 23

Molloy, Michael, Reed, Bruce

2002, XIV, 326 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$139.00

(net) price for USA

ISBN 978-3-642-04016-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$179.00

(net) price for USA

ISBN 978-3-540-42139-9

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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.

Content Level » Research

Keywords » Graph - Graph theory - Matching - Matchings - algorithms - computer - computer science

Related subjects » Probability Theory and Stochastic Processes - Theoretical Computer Science

Table of contents / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Probability Theory and Stochastic Processes.

Additional information