From rather modest beginnings, the British Combinatorial Conference grew into an established biennial international gathering. A successful format for the series of conferences was established, whereby several distinguished mathematicians were invited to give a survey lecture and to write a paper for the conference volume. The 1983 conference was held in Southampton, and this volume contains the invited papers, comprising three each from the United Kingdom, continental Europe and the United States. These papers cover a broad range of combinatorial topics, including enumeration, finite geometries, graph theory and permanents. The book will be of value not only to mathematicians, but also to scientists, engineers and others interested in combinatorial ideas.
Reihe
Sprache
Verlagsort
Zielgruppe
Dateigröße
ISBN-13
978-1-107-10769-4 (9781107107694)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Preface; 1. Graphs and interconnection networks: diameter and vulnerability J. C. Bermond, J. Bond, M. Paoli and C. Peyrat; 2. The friendship theorem and the love problem J. M. Hammersley; 3. Maximum sets in finite projective spaces J. W. P. Hirschfeld; 4. Quasigroup and orthogonal arrays C. C. Lindner; 5. Bounds on permanents, and the number of 1-factors and 1-factorizations of bipartite graphs A. Schrijver; 6. Redfield discovered again J. Sheehan; 7. Characterizations of the lie incidence geometries E. E. Schult; 8. GL(n, C) for combinatorialists R. P. Stanley; 9. Irregularities of partitions: Ramsey theory, uniform distribution; Index of names; Subject index.
