Get Free Shipping on orders over $79
Graph Colouring and the Probabilistic Method - Michael Molloy

Graph Colouring and the Probabilistic Method

By: Michael Molloy, Bruce Reed

eText | 29 June 2013

At a Glance

eText


$219.00

or 4 interest-free payments of $54.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

More in Probability & Statistics

untitled - TBC ANZ

eBOOK

$31.99

An Introduction to Stochastic Modeling - Gabriel Lord

eBOOK

RRP $145.41

$130.99

10%
OFF