Modern Graph Theory
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer\'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Flows Connectivity and Matching
9 other sections not shown
Other editions - View all
adjacency matrix Algebraic algorithm assertion bipartite graph Cayley diagram chromatic number chromatic polynomial Co(G colour combinatorial complete graph components connected graph Corollary Deduce define denote edge xy edges of G eigenvalues electrical network equivalent Erdos ex(n Exercise extremal graph finite flow function G contains graph G graph of order graph theory Hamilton cycle Hamiltonian Hence implies independent edges induced subgraph induction inequality integer knot least Lemma Let G link diagram loop Math max-flow min-cut theorem maximal number minimal degree monochromatic multigraph natural numbers neighbours number of edges oriented partition perfect graph permutation planar plane graph precisely problem proof of Theorem prove random graph random walks rectangle regular graph resistance result satisfies sequence simple spanning forest spanning tree stable matching subgraph of G subsets Suppose Theorem 14 Tr(n trefoil knot triangle trivial Tutte polynomial vector vertex set