| Part I Preliminaries 1 Colouring Preliminaries 2 Probabilistic Preliminaries Part II Basic Probabilistic Tools 3 The First Moment Method 4 The Lovasz Local Lemma 5 The Chernoff Bound Part III Vertex Partitions 6 Hadwiger's Conjecture 7 A First Glimpse of Total Colouring 8 The Strong Chromatic Number 9 Total Colouring Revisited Part IV A Naive Colouring Procedure 10 Talagrand's Inequality and Colouring Sparse Graphs 11 Azuma's Inequality and a Strengthening of Brooks' Theorem Part V An Iterative Approach 12 Graphs with Girth at Least Five 13 Triangle-Free Graphs 14 The List Colouring Conjecture Part VI A Structural Decomposition 15 The Structural Decomposition 16 [omega], [Delta] and [chi] 17 Near Optimal Total Colouring I: Sparse Graphs 18 Near Optimal Total Colouring II: General Graphs Part VII Sharpening our Tools 19 Generalizations of the Local Lemma 20 A Closer Look at Talagrand's Inequality Part VIII Colour Assignment via Fractional Colouring 21 Finding Fractional Colourings and Large Stable Sets 22 Hard-Core Distributions on Matchings 23 The Asymptotics of Edge Colouring Multigraphs Part IX Algorithmic Aspects 24 The Method of Conditional Expectations 25 Algorithmic Aspects of the Local Lemma References Index |
内容加载中，请稍后...
商品评论（0条）