Book contents
- Frontmatter
- Contents
- PREFACE
- GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY
- THE FRIENDSHIP THEOREM AND THE LOVE PROBLEM
- MAXIMUM SETS IN FINITE PROJECTIVE SPACES
- QUASIGROUP IDENTITIES AND ORTHOGONAL ARRAYS
- BOUNDS ON PERMANENTS, AND THE NUMBER OF 1-FACTORS AND 1-FACTORIZATIONS OF BIPARTITE GRAPHS
- REDFIELD DISCOVERED AGAIN
- CHARACTERIZATIONS OF THE LIE INCIDENCE GEOMETRIES
- GL(n, C) FOR COMBINATORIALISTS
- IRREGULARITIES OF PARTITIONS: RAMSEY THEORY, UNIFORM DISTRIBUTION
- INDEX OF NAMES
- SUBJECT INDEX
MAXIMUM SETS IN FINITE PROJECTIVE SPACES
Published online by Cambridge University Press: 05 May 2013
Edited by
Book contents
- Frontmatter
- Contents
- PREFACE
- GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY
- THE FRIENDSHIP THEOREM AND THE LOVE PROBLEM
- MAXIMUM SETS IN FINITE PROJECTIVE SPACES
- QUASIGROUP IDENTITIES AND ORTHOGONAL ARRAYS
- BOUNDS ON PERMANENTS, AND THE NUMBER OF 1-FACTORS AND 1-FACTORIZATIONS OF BIPARTITE GRAPHS
- REDFIELD DISCOVERED AGAIN
- CHARACTERIZATIONS OF THE LIE INCIDENCE GEOMETRIES
- GL(n, C) FOR COMBINATORIALISTS
- IRREGULARITIES OF PARTITIONS: RAMSEY THEORY, UNIFORM DISTRIBUTION
- INDEX OF NAMES
- SUBJECT INDEX
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Surveys in CombinatoricsInvited Papers for the Ninth British Combinatorial Conference 1983, pp. 55 - 76Publisher: Cambridge University PressPrint publication year: 1983
- 19
- Cited by