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
GL(n, C) FOR COMBINATORIALISTS
Published online by Cambridge University Press: 05 May 2013
- 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
- Type
- Chapter
- Information
- Surveys in CombinatoricsInvited Papers for the Ninth British Combinatorial Conference 1983, pp. 187 - 200Publisher: Cambridge University PressPrint publication year: 1983
- 4
- Cited by