Authors:
- The book covers a topic of central interest to discrete mathematics.- The authors are two of the very best on this topic.
- Includes supplementary material: sn.pub/extras
Part of the book series: Algorithms and Combinatorics (AC, volume 23)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (25 chapters)
-
Front Matter
-
Preliminaries
-
Front Matter
-
-
Basic Probabilistic Tools
-
Front Matter
-
-
Vertex Partitions
-
Front Matter
-
-
A Naive Colouring Procedure
-
Front Matter
-
-
An Iterative Approach
-
Front Matter
-
About this book
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.
Reviews
From the reviews of the first edition:
"The presented book contains many … chapters, each of which presents a proof technique and apply that for a certain graph coloring problem. … The book ends with a vast bibliography. We think that this well-written monograph will serve as a main reference on the subject for years to come." (János Barát, Acta Scientiarum Mathematicarum, Vol. 69, 2003)
"The book is a pleasure to read; there is a clear, successful attempt to present the intuition behind the proofs, making even the difficult, recent proofs of important results accessible to potential readers. … The book is highly recommended to researchers and graduate students in graph theory, combinatorics, and theoretical computer science who wish to have this ability." (Noga Alon, SIAM Review, Vol. 45 (2), 2003)
"The probabilistic method in graph theory was initiated by Paul Erdös in 1947 … . This book is an introduction to this powerful method. … The book is well-written and brings the researcher to the frontiers of an exciting field." (M.R. Murty, Short Book Reviews, Vol. 23 (1), April, 2003)
"This monograph provides an accessible and unified treatment of major advances made in graph colouring via the probabilistic method. … Many exercises and excellent remarks are presented and discussed. Also very useful is the list of up-to-date references for current research. This monograph will be useful both to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability." (Jozef Fiamcik, Zentralblatt MATH, Vol. 987 (12), 2002)
Authors and Affiliations
-
Department of Computer Science, University of Toronto, Toronto, Canada
Michael Molloy
-
Université de Paris VI, CNRS, Paris Cedex 05, France
Bruce Reed
-
School of Computer Science, McGill University, Montreal, Canada
Bruce Reed
Bibliographic Information
Book Title: Graph Colouring and the Probabilistic Method
Authors: Michael Molloy, Bruce Reed
Series Title: Algorithms and Combinatorics
DOI: https://doi.org/10.1007/978-3-642-04016-0
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Hardcover ISBN: 978-3-540-42139-9Published: 20 November 2001
eBook ISBN: 978-3-642-04016-0Published: 29 June 2013
Series ISSN: 0937-5511
Series E-ISSN: 2197-6783
Edition Number: 1
Number of Pages: XIV, 326
Topics: Probability Theory and Stochastic Processes, Combinatorics, Theory of Computation, Math Applications in Computer Science, Algorithm Analysis and Problem Complexity