Mehr lesen
Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers extremal graph theory, optimization, polyhedral combinatorics, combinatorics in electrical engineering and other related topics.
Inhaltsverzeichnis
Part II: Aspects. Algebraic enumeration (I.M. Gessel, R.P. Stanley). Asymptotic enumeration methods (A.M. Odlyzko). Extremal graph theory (B. Bollobas). Extremal set systems (P. Frankl). Ramsey Theory (J. Nesetril). Discrepancy theory (J. Beck, V.T. Sos). Automorphism groups, isomorphism, reconstruction (L. Babai). Optimization (M. Grotschel, L. Lovasz). Computational complexity (D.B. Shmoys, E. Tardos). Part III: Methods. Polyhedral combinatorics (A. Schrijver). Tools from linear algebra (C.D. Godsil). Tools from higher algebra (N. Alon). Probabilistic methods (J. Spencer). Topological methods (A. Bjorner). Part IV: Applications. Combinatorics in operations research (A. Kolen, J.K. Lenstra). Combinatorics in electrical engineering and statics (A. Recski). Combinatorics in statistical mechanics (C.D. Godsil, M. Grotschel, D.J.A. Welsh). Combinatorics in chemistry (D.H. Rouvray). Applications of combinatorics to molecular biology (M.S. Waterman). Combinatorics in computer science (L. Lovasz, D.B. Shmoys, E. Tardos). Combinatorics in pure mathematics (L. Lovasz, L. Pyber, D.J.A. Welsh, G.M. Ziegler). Part V: Horizons. Infinite combinatorics (A. Hajnal). Combinatorial games (R.K. Guy). The history of combinatorics (N.L. Biggs, E.K. Lloyd, R.J. Wilson). Author Index. Subject Index.
