Michael Molloy & Bruce Reed 
Graph Colouring and the Probabilistic Method [PDF ebook] 

Apoio

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.

€153.45
Métodos de Pagamento
Compre este e-book e ganhe mais 1 GRÁTIS!
Língua Inglês ● Formato PDF ● ISBN 9783642040160 ● Editora Springer Berlin Heidelberg ● Publicado 2013 ● Carregável 3 vezes ● Moeda EUR ● ID 6321028 ● Proteção contra cópia Adobe DRM
Requer um leitor de ebook capaz de DRM

Mais ebooks do mesmo autor(es) / Editor

49.474 Ebooks nesta categoria