Book contents
- Frontmatter
- Contents
- Preface
- 1 Graphs
- 2 Polar spaces
- 3 Graphs related to polar spaces
- 4 Buildings
- 5 Fischer spaces
- 6 Golay codes,Witt designs, and Leech lattice
- 7 Cyclotomic constructions
- 8 Combinatorial constructions
- 9 p-Ranks
- 10 Individual graph descriptions
- 11 Classification of rank 3 graphs
- 12 Parameter table
- References
- Parameter Index
- Author Index
- Subject Index
2 - Polar spaces
Published online by Cambridge University Press: 06 January 2022
- Frontmatter
- Contents
- Preface
- 1 Graphs
- 2 Polar spaces
- 3 Graphs related to polar spaces
- 4 Buildings
- 5 Fischer spaces
- 6 Golay codes,Witt designs, and Leech lattice
- 7 Cyclotomic constructions
- 8 Combinatorial constructions
- 9 p-Ranks
- 10 Individual graph descriptions
- 11 Classification of rank 3 graphs
- 12 Parameter table
- References
- Parameter Index
- Author Index
- Subject Index
Summary
The second chapter contains some theory of polar spaces. The latter provide the main examples of rank 3 graphs, and, more generally, many examples of strongly regular graphs. Polar spaces are introduced in general as embedded in a projective space, and a full proof of the classification of finite embedded polar spaces is provided.In this chapter, the emphasis is on the graphs whose vertices are objects of a polar space such as the point graph and graphs on (one type of) (maximal) singular subspaces. We review the three types of polar spaces, orthogonal, unitary and symplectic using reflexive forms and discuss Witt’s theorem. For the collinearity graphs of (finite) polar spaces, we discuss, sometimes in detail, sometimes merely surveying, maximal cliques, maximal co-cliques (ovoids), intriguing sets (tight sets and h-ovoids), spreads, partial spreads, hemisystems,…
- Type
- Chapter
- Information
- Strongly Regular Graphs , pp. 33 - 83Publisher: Cambridge University PressPrint publication year: 2022