Graph Colouring and the Probabilistic Method
Available
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 asymptoticall...
The topics covered include: Kahn''s proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptoticall...
Read more
product_type_E-book
pdf
Price
119.50 £
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 asymptoticall...
The topics covered include: Kahn''s proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptoticall...
Read more
Follow the Author
