Cambridge: Cambridge University Press, 1999. — 307 p.
This volume, first published in 1999, is a valuable resource on combinatorics for graduate students and researchers.
Frontmatter
Preface
The Coming of the Matroids
Polynomials in Finite Geometries
Applications of Combinatorial Designs to Communications, Cryptography, and Networking
Random Walks on Combinatorial Objects
Random Walks on Combinatorial Objects
Bose–Burton Type Theorems for Finite Projective, Affine and Polar Spaces
Geometric Graph Theory
Recent Excluded Minor Theorems for Graphs
Parity, Cycle Space, and K4-Subdivisions in Graphs
Models of Random Regular Graphs