The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.
Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. Although geared toward mathematicians and research students, much of Extremal Graph Theory is accessible even to undergraduate students of mathematics. Pure mathematicians will find this text a valuable resource in terms of its unusually large collection of results and proofs, and professionals in other fields with an interest in the applications of graph theory will also appreciate its precision and scope.
Зміст
1. Connectivity.
2. Matching.
3. Cycles.
4. The Diameter.
5. Colourings.
6. Complete Subgraphs.
7. Topological Subgraphs.
8. Complexity and Packing.
References.
Indexes.
