Graph colouring and the probabilistic method /

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 co...

Full description

Bibliographic Details

Main Author:	Molloy, Michael S.
Corporate Author:	SpringerLink (Online service)
Other Authors:	Reed, Bruce A.
Format:	eBook
Language:	English
Published:	Berlin ; New York : Springer, [2002]
Series:	Algorithms and combinatorics ; 23.
Subjects:	Graph coloring. Combinatorial analysis. Probabilities. Probability Theory and Stochastic Processes. Theory of Computation. Math Applications in Computer Science. Algorithm Analysis and Problem Complexity. Grafentheorie. Kleuren. Kombinatorische Wahrscheinlichkeitstheorie. Graphfärbung. Electronic books.
Online Access:	Connect to the full text of this electronic book