Surveys in Combinatorics, 1997 /
Edited by R. A. Bailey.
- Cambridge : Cambridge University Press, 1997.
- 1 online resource (356 pages) : digital, PDF file(s).
- London Mathematical Society Lecture Note Series ; no. 241 .
- London Mathematical Society Lecture Note Series ; no. 241. .
Title from publisher's bibliographic system (viewed on 16 Oct 2015).
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.
9780511662119 (ebook)
Combinatorial mathematics
QA164 / .S883 1997
511/.6
Title from publisher's bibliographic system (viewed on 16 Oct 2015).
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.
9780511662119 (ebook)
Combinatorial mathematics
QA164 / .S883 1997
511/.6