Graph Colouring and the Probabilistic Method
Our rough guess is there are 81,500 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 26 minutes to read. With a half hour per day, this will take 11 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
81,500 words, Guess
Page Count
326 pages
Identifiers
- ISBN-139783642040160
- ISBN-103642040160
- Better World Books9783642040160
- Open LibraryOL34472559M
Classifications
- LCCQA1-939
Description
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.
Subjects
Other Editions
- Graph Colouring and the Probabilistic Method
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!