Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Graph Colouring and the Probabilistic Method

Name: Graph Colouring and the Probabilistic Method
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 05273971
Price: 164.39 EUR
Availability: InStock
Author: Michael Molloy
ISBN: 9783540421399

Michael Molloy

Bruce Reed

Language

English

Book Hardback

Libristo code: 05273971

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, November 2001

Over the past decade, many major advances have been made in the field of graph colouring via the pro... Full description

Libristo code: 05273971

402 b

164.39 € VAT included

50 % chance We search the world When will I receive my book?

Delivery to Austria

Up to 30 days for returns

Customers also purchased

Shifting Patterns Eva Guttmann

Paperback

49.99 €

ANTONIO LUCIO VIVALDI: CONCERTO IN E MINOR (CELLO & ORCHESTRA) VIVALDI Book

binding.

40.79 €

LA SIRENITA STEELBOOK BD

Book

36.99 €

Kalendář 2026 Čechy a Morava, nástěnný, 34 x 48,5 cm

Calendar

9.59 €

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.