Graph Colouring and the Probabilistic Method [electronic resource] /

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.

Bibliographic Details

Main Authors:	Molloy, Michael. author., Reed, Bruce. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002
Subjects:	Mathematics., Computers., Algorithms., Computer science, Probabilities., Combinatorics., Probability Theory and Stochastic Processes., Theory of Computation., Math Applications in Computer Science., Algorithm Analysis and Problem Complexity.,
Online Access:	http://dx.doi.org/10.1007/978-3-642-04016-0
Tags:	Add Tag No Tags, Be the first to tag this record!