Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
88 views

Extremal Graph Theory: The Art of Combin Atorics - Volume I

This document provides a summary of graph theory concepts across multiple chapters. It begins with foundational topics like vertices, edges, paths and cycles. Later chapters discuss more advanced topics such as matching, coloring, perfect graphs and forbidden subgraphs. The document is a reference for graph theorists, providing definitions and results on a wide range of extremal graph theory problems.

Uploaded by

Srikanta Pramanik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
88 views

Extremal Graph Theory: The Art of Combin Atorics - Volume I

This document provides a summary of graph theory concepts across multiple chapters. It begins with foundational topics like vertices, edges, paths and cycles. Later chapters discuss more advanced topics such as matching, coloring, perfect graphs and forbidden subgraphs. The document is a reference for graph theorists, providing definitions and results on a wide range of extremal graph theory problems.

Uploaded by

Srikanta Pramanik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

iii iv

THE ART OF COMBINATORICS - VOLUME I 2.2 - Algorithmic Aspects. 137


Maximum Matching. 137
EXTREMAL GRAPH THEORY Weighted Bipartite Matching. 145

c Douglas B. West Stable Matching. 151
On-line Matching. 153
Introduction 1 Exercises. 164
Vertices, Edges, and Adjacency. 1 2.3 - Factors and Edge-Packings. 169
Isomorphism, Subgraphs, and Degrees. 5 f-Factors of Graphs. 169
Paths, Cycles, and Parity. 10 Factors in Special Cases. 175
Graph Parameters. 17 g , f-Factors. 182
Operations on Graphs. 19 Computational Aspects. 183
Complexity. 23 Exercises. 185
Exercises. 25
2.4 - Stable Sets and Covers. 187
Chapter 1 - Trees and Distance 30 Structure of Stable Sets and Covers. 187
Extremal Problems and Heuristics. 190
1.1 - Trees and optimization. 31 Dominating Sets. 197
Properties of Trees. 31 Independent Domination and Kernels. 204
Optimal Spanning Trees. 35 Exercises. 207
Optimal Search Trees and Coding. 42
Exercises. 49
Chapter 3 - Coloring 214
1.2 - Diameter and distance. 53
Elementary Properties. 53 3.1 - Vertex Colorings. 215
Search Trees. 55 Upper Bounds. 217
Graphs with Given Diameter. 63 Generalized Colorings. 220
Oriented Diameter. 64 Acyclic Colorings and Star Colorings. 226
Average Distance. 70 Other Restricted Colorings. 236
Diameter of Special Classes (unfinished). 74 Computational Aspects (optional). 239
Exercises. 75 Exercises. 244
1.3 - Encodings and Embeddings. 81 3.2 - k-Chromatic Graphs. 253
Embeddings in Squashed Cubes. 81 Triangle-Free Graphs. 253
Bandwidth. 95 k-Chromatic Graphs with Large Girth. 255
Edge-Bandwidth. 94 Color-Critical Graphs. 259
Sperner ’s Lemma. 98 Forced Subgraphs. 268
Exercises. 100 Exercises. 273

Chapter 2 - Matching and Independence 106 3.3 - Edge-Colorings. 279


Special Classes. 280
2.1 - Existence of Matchings. 107 Vizing ’s Theorem and Extensions. 285
Matching in Bipartite Graphs. 107 Critical Graphs. 288
Menger ’s Theorems. 113 Hypergraphs. 291
Matching in General Graphs. 117 Parity Edge-Coloring. 293
Classical applications. 121 Interval Edge-Coloring. 301
Matching in Regular Graphs (optional). 123 Neighbor-Distinguishing Weightings. 309
Exercises. 128 Exercises. 311
v vi

3.4 - List Coloring. 319 Interval Graphs. 496


Upper Bounds. 320 Threshold Graphs. 503
Bipartite Graphs. 323 Tolerance Graphs. 507
List Edge-Coloring. 328 Parity Graphs and Meyniel Graphs. 511
Planar Graphs. 337 Exercises. 517
The Alon–Tarsi Theorem. 339
Paintability. 342
4.4 - Intersection Classes. 527
General Intersection Classes. 527
Precoloring Extension. 354
Line Graphs. 530
Exercises. 356
Other Intersection Graphs. 533
3.5 - Circular Coloring and Homomorphisms. 363 Intersection Digraphs and Bigraphs. 536
Circular Chromatic Number. 363 Exercises. 543
(k , d)-Colorings. 367
Extreme Circular Chromatic Numbers. 370 Chapter 5 - Other Extremal Problems 548
Graph Homomorphism. 377
Fractional Chromatic Number. 379 5.1 - Forbidden Subgraphs. 549
Cores and Retracts. 382 Cliques and Turán’s Theorem. 549
Exercises. 385 Erdős–Stone–Simonivits Theorem. 557
3.6 - The Discharging Method. 389 Bicliques and Zarankiewicz’s Problem. 562
Maximum Average Degree. 390 Saturation Numbers. 570
List Coloring. 398 Extremal Problems for Hypergraphs. 573
Edge-Coloring and List Edge-Coloring. 401 Forbidden Induced Subgraphs. 579
Planar Graphs. 405 Exercises. 583
Exercises. 412 5.2 - Graph Ramsey Theory. 589
Ramsey Numbers. 589
Chapter 4 - Perfection and Imperfection 416 Graph Ramsey Numbers. 594
Graphs with Bounded Degree. 598
4.1 - Perfect Graphs. 417 Restricted Ramsey Theory. 605
Classical Examples. 419 Parameter Ramsey Theory. 609
The Perfect Graph Theorem. 413 Anti-Ramsey Theory and Beyond. 612
Larger Classes of Perfect Graphs. 416 Exercises. 616
The Star-Cutset Lemma. 421
Exercises. 426 5.3 - Graph Decomposition. 623
Complete Graphs. 623
4.2 - Imperfect Graphs. 439 Forests and Trees. 627
Partitionable Graphs. 440
Fractional Arboricity. 630
The Strong Perfect Graph Conjecture. 446
Paths and Cycles. 636
The Strong Perfect Graph Theorem. 451
Exercises. 639
Exercises. 455
4.3 - The World of Perfect Graphs. 459 5.4 - Representation Parameters. 643
Intersection Number. 643
Chordal Graphs. 460
Boxicity. 645
Strongly Chordal Graphs. 465
Multiple Interval Representations. 648
Chordal Bipartite Graphs. 478
Visibility Representations. 657
Comparability Graphs. 482
Leafage and Other Parameters. 662
Modular Decomposition. 487
Exercises. 668
Cocomparability and Permutation Graphs. 492

You might also like