Handbook of Combinatorics

摘要: Part 1 Structures: graphs - basic graph theory paths and circuits, J.A. Bondy, connectivity network flows, A. Frank, matchings extensions, W.R. Pulleyblank, colouring, stable sets perfect graphs, B. Toft, embeddings minors, C. Thomassen, random M. Karonski finite relations hypergraphs, P. Duchet, partially ordered sets, W.T. Trotter matroids fundamental concepts, D.J.A. Welsh, matroid P.D. Seymour, optimization algorithms, R.E. Bixby W.H. Cunningham symmetric structures permutation groups, P.J. Cameron, geometries, block designs, A.E. Brouwer, association schemes, Brouwer W. Haemers, codes, J.H. van Lint combinatorial in geometry number extremal problems geometry, Erdos G. Purdy, convex polytopes related complexes, V. Klee Kleinschmidt, point lattices, J.C. Lagarias, theory, Pomerance Sarkozy. 2 Aspects: algebraic enumeration, I.M. Gessel R.P. Stanley asymptotic enumeration methods, A.M. Odlyzko Bollobas set systems, Frankl Ramsey J. Nesetril discrepancy Beck V.T. Sos automorphism isomorphism, reconstruction, L. Babai optimization, Grotschel Lovasz computational complexity, D.B. Shmoys E. Tardos. 3 Methods: polyhedral combinatorics, Schrijver tools from linear algebra, C.D. Godsil higher N. Alon probabilistic Spencer topological Bjorner. 4 Applications: combinatorics operations research, Kolen J.K. Lenstra electrical engineering statics, Recski statistical mechanics, et al chemistry, D.H. Rouvray applications of to molecular biology, M.S. Waterman computer science, pure mathematics, al. 5 Horizons: infinite Hajnal games, R.K. Guy the history N.L. Biggs