Dabrowski / Gadouleau / Georgiou | Surveys in Combinatorics 2021 | Buch | 978-1-009-01888-3 | www.sack.de

Buch, Englisch, 1 Seiten, Format (B × H): 196 mm x 226 mm, Gewicht: 544 g

Reihe: London Mathematical Society Lecture Note Series

Dabrowski / Gadouleau / Georgiou

Surveys in Combinatorics 2021


Erscheinungsjahr 2021
ISBN: 978-1-009-01888-3
Verlag: Cambridge University Press

Buch, Englisch, 1 Seiten, Format (B × H): 196 mm x 226 mm, Gewicht: 544 g

Reihe: London Mathematical Society Lecture Note Series

ISBN: 978-1-009-01888-3
Verlag: Cambridge University Press


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.

Dabrowski / Gadouleau / Georgiou Surveys in Combinatorics 2021 jetzt bestellen!

Weitere Infos & Material


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 Kühn 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.


Georgiou, Nicholas
Nicholas Georgiou is Assistant Professor in the Department of Mathematical Sciences at Durham University.

Gadouleau, Maximilien
Maximilien Gadouleau is Associate Professor in the Department of Computer Science at Durham University.

Johnson, Matthew
Matthew Johnson is Professor in the Department of Computer Science at Durham University.

Mertzios, George B.
George B. Mertzios is Associate Professor in the Department of Computer Science at Durham University.

Dabrowski, Konrad K.
Konrad K. Dabrowski is Teaching Fellow in the Department of Computer Science at Durham University.

Paulusma, Daniël
Daniël Paulusma is Professor in the Department of Computer Science at Durham University.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.