↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Graph Colouring and the Probabilistic Method
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
Colouring Preliminaries
Altmetric Badge
Chapter 2
Probabilistic Preliminaries
Altmetric Badge
Chapter 3
The First Moment Method
Altmetric Badge
Chapter 4
The Lovász Local Lemma
Altmetric Badge
Chapter 5
The Chernoff Bound
Altmetric Badge
Chapter 6
Hadwiger’s Conjecture
Altmetric Badge
Chapter 7
A First Glimpse of Total Colouring
Altmetric Badge
Chapter 8
The Strong Chromatic Number
Altmetric Badge
Chapter 9
Total Colouring Revisited
Altmetric Badge
Chapter 10
Talagrand’s Inequality and Colouring Sparse Graphs
Altmetric Badge
Chapter 11
Azuma’s Inequality and a Strengthening of Brooks’ Theorem
Altmetric Badge
Chapter 12
Graphs with Girth at Least Five
Altmetric Badge
Chapter 13
Triangle-Free Graphs
Altmetric Badge
Chapter 14
The List Colouring Conjecture
Altmetric Badge
Chapter 15
The Structural Decomposition
Altmetric Badge
Chapter 16
ω, Δ and χ
Altmetric Badge
Chapter 17
Near Optimal Total Colouring I: Sparse Graphs
Altmetric Badge
Chapter 18
Near Optimal Total Colouring II: General Graphs
Altmetric Badge
Chapter 19
Generalizations of the Local Lemma
Altmetric Badge
Chapter 20
A Closer Look at Talagrand’s Inequality
Altmetric Badge
Chapter 21
Finding Fractional Colourings and Large Stable Sets
Altmetric Badge
Chapter 22
Hard-Core Distributions on Matchings
Altmetric Badge
Chapter 23
The Asymptotics of Edge Colouring Multigraphs
Altmetric Badge
Chapter 24
The Method of Conditional Expectations
Altmetric Badge
Chapter 25
Algorithmic Aspects of the Local Lemma
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
syllabi
4
institutions with syllabi
wikipedia
4
Wikipedia pages
Citations
dimensions_citation
250
Dimensions
Readers on
mendeley
23
Mendeley
Book overview
1. Colouring Preliminaries
2. Probabilistic Preliminaries
3. The First Moment Method
4. The Lovász Local Lemma
5. The Chernoff Bound
6. Hadwiger’s Conjecture
7. A First Glimpse of Total Colouring
8. The Strong Chromatic Number
9. Total Colouring Revisited
10. Talagrand’s Inequality and Colouring Sparse Graphs
11. Azuma’s Inequality and a Strengthening of Brooks’ 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’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
Summary
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
6
syllabi from
4
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
University of Oxford
3
Business, Biology
University at Buffalo
1
Computer Science
Tel Aviv University
1
Unknown
Unknown
1
Business, Chemistry, Engineering, Medicine