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
Contents
Published online by Cambridge University Press: 08 June 2021
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
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 Combinatorics 2021 , pp. v - viPublisher: Cambridge University PressPrint publication year: 2021