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

Ajutor

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
Metode de plata
Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● ISBN 9783642040160 ● Editura Springer Berlin Heidelberg ● Publicat 2013 ● Descărcabil 3 ori ● Valută EUR ● ID 6321028 ● Protecție împotriva copiilor Adobe DRM
Necesită un cititor de ebook capabil de DRM

Mai multe cărți electronice de la același autor (i) / Editor

50.053 Ebooks din această categorie