This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.
Author(s): Anders Claesson, Mark Dukes, Sergey Kitaev, David Manlove, Kitty Meeks
Series: London Mathematical Society Lecture Note Series 440
Publisher: Cambridge University Press
Year: 2017
Language: English
Pages: 452
Contents......Page 6
Preface......Page 8
1 Relations among partitions......Page 10
2 Large-scale structures in random graphs......Page 95
3 The spt-function of Andrews......Page 150
4 Combinatorial structures in finite classical polar spaces......Page 213
5 Switching techniques for edge decompositions of graphs......Page 247
6 Ramsey-type and amalgamation-type properties of permutations......Page 281
7 Monotone cellular automata......Page 321
8 Robustness of graph properties......Page 381
9 Some applications of relative entropy in additive combinatorics......Page 418
