Mohlo by se vám také líbit

Informovat o naskladnění knihy

Více informací o knize Graph Colouring and the Probabilistic Method

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Anotace knihy

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. From the reviews: "The ... book contains many ... chapters, each of which presents a proof technique and apply that for a certain graph coloring problem. ... The book ends with a vast bibliography. We think that this well-written monograph will serve as a main reference on the subject for years to come." J.Barát, Acta Scient.Math.2003 "The book is a pleasure to read; there is a clear, successful attempt to present the intuition behind the proofs, making even the difficult, recent proofs of important results accessible to potential readers. ... The book is highly recommended to researchers and graduate students in graph theory, combinatorics, and theoretical computer science who wish to have this ability." N. Alon, SIAM Review 2003 TOC:Colouring Preliminaries.- Probabilistic Preliminaries.- The First Moment Method.- The Lovasz Local Lemma.- The Chernoff Bound.- Hadwiger's Conjecture.- A First Glimpse of Total Colouring.- The Strong Chromatic Number.- Total Colouring Revisited.- Talagrand's Inequality and Colouring Sparse Graphs.- Azuma's Inequality and a Strengthening of Brooks'Theorem.- Graphs with Girth at Least Five.- Triangle-Free Graphs.- The List Colouring Conjecture.- A Structural Decomposition.- Omega,Delta, and Chi.- Near Optimal Total Colouring I: Sparse Graphs.- Near Optimal Total Colouring II: General Graphs.- Generalizations of the Local Lemma.- A Closer Look at Talagrand's Inequality.- Finding Fractional Colourings and Large Stable Sets.- Hardcore Distribution on Matchings.- The Asymptotics of Edge Colouring Multigraphs.- The Method of Conditional Expectation.- Algorithmic Aspects of the Local Lemma.

Parametry knihy

• Plný název: Graph Colouring and the Probabilistic Method
• Autor: Michael S. O. Molloy, Bruce Reed
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 326
• EAN: 9783642040153
• ISBN: 3642040152
• ID: 12627393
• Nakladatelství: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Rozměry: 235 × 155 mm
• Datum vydání: December 2013

Oblíbené z jiného soudku

---

---

---