Surveys in Combinatorics 2021

Description

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. Front matter Copyright 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