Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Surveys in Combinatorics, 1999 -

Surveys in Combinatorics, 1999

J. D. Lamb, D. A. Preece (Herausgeber)

Buch | Softcover
310 Seiten
1999
Cambridge University Press (Verlag)
978-0-521-65376-3 (ISBN)
CHF 102,95 inkl. MwSt
The British Combinatorial Conference is one of the most well known meetings for combinatorialists. This volume collects the invited talks from the 1999 conference held at the University of Kent, spanning a broad range of combinatorial topics. All researchers into combinatorics will find this volume an outstanding and up-to-date resource.
The British Combinatorial Conference is one of the most well known meetings for combinatorialists. This volume collects the invited talks from the 1999 conference held at the University of Kent and together these span a broad range of combinatorial topics. The nine talks are from: S. Ball, J. Dinitz, M. Dyer, K. Metsch, J. Pach, R. Thomas, C. Thomassen, N. Wormald, plus a special contribution from W. T. Tutte. All researchers into combinatorics will find this volume an outstanding and up-to-date resource.

1. The coming of the Matroids W. T. Tutte; 2. Polynomials in finite geometries Simeon Ball; 3. Selected applications of design theory Jeff Dinitz; 4. Random walks on combinatorial objects Martin Dyer; 5. Covers and blocking configurations in projective spaces and in polar spaces Klaus Metsch; 6. Geometric graph theory Janos Pach; 7. Excluded minors of graphs Robin Thomas; 8. Cycle space and parity in graph theory Carsten Thomassen; 9. Models of random regular graphs Nick Wormald.

Erscheint lt. Verlag 1.7.1999
Reihe/Serie London Mathematical Society Lecture Note Series
Zusatzinfo 12 Line drawings, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 152 x 229 mm
Gewicht 460 g
Themenwelt Mathematik / Informatik Mathematik Allgemeines / Lexika
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-521-65376-2 / 0521653762
ISBN-13 978-0-521-65376-3 / 9780521653763
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich