Check nearby libraries
Buy this book
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.
Check nearby libraries
Buy this book
Showing 2 featured editions. View all 2 editions?
Edition | Availability |
---|---|
1
Graph Colouring and the Probabilistic Method
2013, Springer London, Limited
in English
3642040160 9783642040160
|
aaaa
Libraries near you:
WorldCat
|
2
Graph Colouring and the Probabilistic Method
Jan 01, 2003, Springer
paperback
3642040152 9783642040153
|
zzzz
Libraries near you:
WorldCat
|
Community Reviews (0)
Feedback?History
- Created October 5, 2021
- 1 revision
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
October 5, 2021 | Created by ImportBot | Imported from Better World Books record |