
Surveys in Combinatorics 2021
Cambridge University Press
Published on 24. June 2021
Book
Paperback/Softback
378 pages
978-1-009-01888-3 (ISBN)
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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 20 mm
Weight
547 gr
ISBN-13
978-1-009-01888-3 (9781009018883)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Konrad K. Dabrowski | Maximilien Gadouleau | Nicholas Georgiou
Surveys in Combinatorics 2021
E-Book
06/2021
Cambridge University Press
€77.49
Available for download
Persons
Editor
Durham University
Durham University
Durham University
Durham University
Durham University
Durham University
Content
1. The partition complex: an invitation to combinatorial commutative algebra Karim Adiprasito and Geva Yashfe; 2. Hasse-Weil type theorems and relevant classes of polynomial functions Daniele Bartoli; 3. Decomposing the edges of a graph into simpler structures Marthe Bonamy; 4. Generating graphs randomly Catherine Greenhill; 5. Recent advances on the graph isomorphism problem Martin Grohe and Daniel Neuen; 6. Extremal aspects of graph and hypergraph decomposition problems Stefan Glock, Daniela Kuehn and Deryk Osthus; 7. Borel combinatorics of locally finite graphs Oleg Pikhurko; 8. Codes and designs in Johnson graphs with high symmetry Cheryl E. Praeger; 9. Maximal subgroups of finite simple groups: classifications and applications Colva M. Roney-Dougal.