Book contents
- Frontmatter
- Contents
- Preface
- 1 The partition complex: an invitation to combinatorial commutative algebra
- 2 Hasse-Weil type theorems and relevant classes of polynomial functions
- 3 Decomposing the edges of a graph into simpler structures
- 4 Generating graphs randomly
- 5 Recent advances on the graph isomorphism problem
- 6 Extremal aspects of graph and hypergraph decomposition problems
- 7 Borel combinatorics of locally finite graphs
- 8 Codes and designs in Johnson graphs with high symmetry
- 9 Maximal subgroups of finite simple groups: classifications and applications
9 - Maximal subgroups of finite simple groups: classifications and applications
Published online by Cambridge University Press: 08 June 2021
- Frontmatter
- Contents
- Preface
- 1 The partition complex: an invitation to combinatorial commutative algebra
- 2 Hasse-Weil type theorems and relevant classes of polynomial functions
- 3 Decomposing the edges of a graph into simpler structures
- 4 Generating graphs randomly
- 5 Recent advances on the graph isomorphism problem
- 6 Extremal aspects of graph and hypergraph decomposition problems
- 7 Borel combinatorics of locally finite graphs
- 8 Codes and designs in Johnson graphs with high symmetry
- 9 Maximal subgroups of finite simple groups: classifications and applications
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781009036214/resource/name/firstPage-9781009018883c9_343-370.jpg)
- Type
- Chapter
- Information
- Surveys in Combinatorics 2021 , pp. 343 - 370Publisher: Cambridge University PressPrint publication year: 2021