Graph colouring and the probabilistic method

Autori

• Michael Molloy

Parametri

Pagine

240pagine

Tempo di lettura

9ore

• Libri da colorare
• Matematica
• Algorithms and combinatorics

Maggiori informazioni sul libro

Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.

Per saperne di più

Lingua: Inglese

Pubblicato: 2002

(Copertina rigida)