Surveys in Combinatorics, 1997
Seiten
1997
Cambridge University Press (Verlag)
978-0-521-59840-8 (ISBN)
Cambridge University Press (Verlag)
978-0-521-59840-8 (ISBN)
This volume contains the invited lectures given at the Sixteenth British Combinatorial Conference, held in July 1997 at Queen Mary and Westfield College. It provides a valuable survey of the present state of knowledge in combinatorics.
This volume contains the invited lectures given at the Sixteenth British Combinatorial Conference, held in July 1997 at Queen Mary and Westfield College, University of London. This biennial conference is a well-established international event, with speakers from all over the world. Contained here is a survey of some of the most important work ever in graph theory, with related papers that will be essential background reading to anyone doing research in this field. Also included is an illustration of how recent developments in group theory lead to advances in graph theory, and an exciting new construction of one of the Mathieu groups. Other articles show how to construct a block design, and how to use finite geometries. An account is given of the computational complexity of counting. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.
This volume contains the invited lectures given at the Sixteenth British Combinatorial Conference, held in July 1997 at Queen Mary and Westfield College, University of London. This biennial conference is a well-established international event, with speakers from all over the world. Contained here is a survey of some of the most important work ever in graph theory, with related papers that will be essential background reading to anyone doing research in this field. Also included is an illustration of how recent developments in group theory lead to advances in graph theory, and an exciting new construction of one of the Mathieu groups. Other articles show how to construct a block design, and how to use finite geometries. An account is given of the computational complexity of counting. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.
1. Distinguishing symmetry groups J. Conway; 2. The harmonious chromatic number and achromatic number of graphs K. J. Edwards; 3. Computer construction of block designs C. W. H. Lam; 4. Finite quasiprimitive graphs C. E. Praeger; 5. Tree width and some variations B. Reed; 6. Minor-monotone graph parameters A. Schrijver; 7. Applications of algebraic curves in finite geometry T. Szonyi; 8. Finite partially ordered sets T. Trotter; 9. Approximate counting D. J. A. Welsh.
| Erscheint lt. Verlag | 31.7.1997 |
|---|---|
| Reihe/Serie | London Mathematical Society Lecture Note Series |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 152 x 229 mm |
| Gewicht | 485 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 0-521-59840-0 / 0521598400 |
| ISBN-13 | 978-0-521-59840-8 / 9780521598408 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
