HANDBOOK OF COMBINATORICS VOLUME 1By
- UNKNOWN AUTHOR
Hardbound, 1120 Pages
Published: December 1995
Part I: Structures.
Graphs. Basic graph theory: paths and circuits (J.A. Bondy). Connectivity and network flows (A. Frank). Matchings and extensions (W.R. Pulleyblank). Colouring, stable sets, and perfect graphs (B. Toft). Embeddings and minors (C. Thomassen). Random graphs (M. Karoński). Finite Sets and Relations. Hypergraphs (P. Duchet). Partially ordered sets (W.T. Trotter). Matroids. Matroids: fundamental concepts (D.J.A. Welsh). Matroid minors (P.D. Seymour). Matroid optimization and algorithms (R.E. Bixby, W.H. Cunningham). Symmetric Structures. Permutation groups (P.J. Cameron). Finite geometries (P.J. Cameron). Block designs (A.E. Brouwer). Association schemes (A.E. Brouwer, W. Haemers). Codes (J.H. van Lint). Combinatorial Structures in Geometry and Number Theory. Extremal problems in combinatorial geometry (P. Erdös, G. Purdy). Convex polytopes and related complexes (V. Klee, P. Kleinschmidt). Point lattices (J.C. Lagarias). Combinatorial number theory (C. Pomerance, A. Sárközy). Author Index. Subject Index.