Surveys in Combinatorics 2007 -

Surveys in Combinatorics 2007

Anthony Hilton, John Talbot (Herausgeber)

Buch | Softcover
296 Seiten
2007
Cambridge University Press (Verlag)
978-0-521-69823-8 (ISBN)
68,55 inkl. MwSt
This volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference held in July 2007 at the University of Reading. By its nature this volume provides an overview of research activity in several areas of combinatorics, from combinatorial number theory to geometry.
This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the 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.

Anthony Hilton is Professorial Research Fellow in the School of Mathematics at Queen Mary University of London and an Emeritus Professor in the Department of Mathematics at the University of Reading. John Talbot is a Lecturer and Royal Society University Research Fellow in the Department of Mathematics at University College London.

Preface; 1. Hereditary and monotone properties of combinatorial structures B. Bollobas; 2. Ordering classes of matrices of 0's and 1's R. A. Brualdi; 3. Cycle decompositions of complete graphs D. Bryant; 4. Excluding induced subgraphs M. Chudnovsky and P. Seymour; 5. Designs and topology M. J. Grannell and T. S. Griggs; 6. The number of points on an algebraic curve over a finite field J. W. P. Hirschfeld, G. Korchmaros and F. Torres; 7. On the efficient approximability of constraint satisfaction problems J. Hastad; 8. The combinatorics of cryptographic key establishment K. M. Martin; 9. Bandwidth of graphic matroids F. Mazoit and S. Thomasse.

Erscheint lt. Verlag 5.7.2007
Reihe/Serie London Mathematical Society Lecture Note Series
Verlagsort Cambridge
Sprache englisch
Maße 153 x 229 mm
Gewicht 410 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-521-69823-5 / 0521698235
ISBN-13 978-0-521-69823-8 / 9780521698238
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
64,95