
Surveys in Combinatorics 2021
- English
- PDF
- Available on iOS & Android
Surveys in Combinatorics 2021
About this book
This volume contains nine survey articles based on plenary lectures given at the 28th British Combinatorial Conference, hosted online by Durham University in July 2021. This biennial conference is a well-established international event, attracting speakers from around the world. Written by some of the foremost researchers in the field, these surveys provide up-to-date overviews of several areas of contemporary interest in combinatorics. Topics discussed include maximal subgroups of finite simple groups, Hasse–Weil type theorems and relevant classes of polynomial functions, the partition complex, the graph isomorphism problem, and Borel combinatorics. Representing a snapshot of current developments in combinatorics, this book will be of interest to researchers and graduate students in mathematics and theoretical computer science.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Series information
- Title page
- Copyright information
- Contents
- Preface
- The partition complex: an invitation to combinatorial commutative algebra
- Hasse-Weil type theorems and relevant classes of polynomial functions
- Decomposing the edges of a graph into simpler structures
- Generating graphs randomly
- Recent advances on the graph isomorphism problem
- Extremal aspects of graph and hypergraph decomposition problems
- Borel combinatorics of locally finite graphs
- Codes and designs in Johnson graphs with high symmetry
- Maximal subgroups of nite simple groups: classifications and applications