Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorMolloy, Michael. author
TitleGraph Colouring and the Probabilistic Method [electronic resource] / by Michael Molloy, Bruce Reed
ImprintBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002
Connect tohttp://dx.doi.org/10.1007/978-3-642-04016-0
Descript XIV, 326 p. online resource

SUMMARY

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


CONTENT

1. Colouring Preliminaries -- 2. Probabilistic Preliminaries -- 3. The First Moment Method -- 4. The Lovรกsz Local Lemma -- 5. The Chernoff Bound -- 6. Hadwigerโ{128}{153}s Conjecture -- 7. A First Glimpse of Total Colouring -- 8. The Strong Chromatic Number -- 9. Total Colouring Revisited -- 10. Talagrandโ{128}{153}s Inequality and Colouring Sparse Graphs -- 11. Azumaโ{128}{153}s Inequality and a Strengthening of Brooksโ{128}{153} Theorem -- 12. Graphs with Girth at Least Five -- 13. Triangle-Free Graphs -- 14. The List Colouring Conjecture -- 15. The Structural Decomposition -- 16. ?, ? and ? -- 17. Near Optimal Total Colouring I: Sparse Graphs -- 18. Near Optimal Total Colouring II: General Graphs -- 19. Generalizations of the Local Lemma -- 20. A Closer Look at Talagrandโ{128}{153}s Inequality -- 21. Finding Fractional Colourings and Large Stable Sets -- 22. Hard-Core Distributions on Matchings -- 23. The Asymptotics of Edge Colouring Multigraphs -- 24. The Method of Conditional Expectations -- 25. Algorithmic Aspects of the Local Lemma -- References


Mathematics Computers Algorithms Computer science -- Mathematics Probabilities Combinatorics Mathematics Probability Theory and Stochastic Processes Combinatorics Theory of Computation Math Applications in Computer Science Algorithm Analysis and Problem Complexity



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram