British Combinatorial Conferences are currently held every two years, and are run by the British Combinatorial Committee. This page provides information about each of the conferences.

You can also read an article by Norman Biggs on "British Combinatorics in Ancient Times (1969 - 1977)", reproduced from the 1997 British Combinatorial Bulletin.

**(BCC1)**University of Oxford, 7-10 July 1969**(BCC2)**Royal Holloway College, London, 4-10 July 1971**(BCC3)**University of Oxford, 3-7 July 1972**BCC(4)**University College of Wales, Aberystwyth, 2-6 July 1973**BCC5**University of Aberdeen, 14-18 July 1975**BCC6**Royal Holloway College, London, 11-15 July 1977**BCC7**University of Cambridge, 13-17 August 1979**BCC8**University College, Swansea, 20-24 July 1981**BCC9**University of Southampton, 11-15 July 1983**BCC10**University of Glasgow, 22-26 July 1985**BCC11**Goldsmiths College, London, 13-17 July 1987**BCC12**University of East Anglia, Norwich, 3-7 July 1989**BCC13**University of Surrey, Guildford, 8-12 July 1991**BCC14**University of Keele, 5-9 July 1993**BCC15**University of Stirling, 3-7 July 1995**BCC16**Queen Mary and Westfield College, London, 7-11 July 1997**BCC17**University of Kent at Canterbury, 12-16 July 1999**BCC18**University of Sussex, Brighton, 2-6 July 2001**BCC19**University of Wales, Bangor, 30 June - 4 July 2003**BCC20**University of Durham, 11-15 July 2005 (organised jointly with the Open University)**BCC21**University of Reading, 9-13 July 2007**BCC22**University of St. Andrews, 6-10 July 2009**BCC23**University of Exeter, 4-8 July 2011**BCC24**Royal Holloway, University of London, 1-5 July 2013**BCC25**University of Warwick, 6-10 July 2015**BCC26**University of Strathclyde, 3-7 July 2017**BCC27**University of Birmingham, 29 July - 2 August 2019**BCC28**Online, organised by University of Durham, 5-9 July 2021**BCC29**University of Lancaster, 11-15 July 2022

University of Oxford, 7-10 July 1969

75 participants.

Combinatorial Mathematics and its Applications. Edited by D. J. A. Welsh. Academic Press, London/New York, 1971. x+364 pp. ISBN-10: 0-12-743350-3, ISBN-13: 978-0-12-743350-9

17 participants.

University of Oxford, 3-7 July 1972

41 participants.

Combinatorics. Edited by D. J. A. Welsh and D. R. Woodall. The Institute of Mathematics and its Applications, Southend-on-Sea, 1972. x+363 pp. ISBN-10: 0-9501159-4-0, ISBN-13: 978-0-9501159-4-8

University College of Wales, Aberystwyth, 2-6 July 1973

86 participants.

- H. Lüneburg,
*Affine planes of rank 3* - C. St.J. A. Nash-Williams,
*The denumerably infinite case of the marriage problem* - W. T. Tutte,
*Some polynomials associated with graphs* - J. H. van Lint,
*Equidistant point sets*

Published in: Combinatorics. Edited by T. P. McDonough and V. C. Mavron. London Mathematical Society Lecture Note Series, 13. Cambridge University Press, Cambridge, 1974. v+204 pp. ISBN-10: 0-521-20454-2, ISBN-13: 978-0-521-20454-5

The talks by H. Lüneburg and C. St.J. A. Nash-Williams do not appear in this volume.

University of Aberdeen, 14-18 July 1975

117 participants.

- C. Berge,
*A theorem related to the Chvatal conjecture* - G. A. Dirac,
*Structural properties and circuits in graphs* - P. Erdős,
*Problems and results in graph theory and combinatorial analysis* - F. Harary,
*The foremost open problems in generalized Ramsey theory* - L. Lovász,
*Covers, packings, and some heuristic algorithms* - R. Rado,
*The selection of disjoint subsets of given sets* - W. T. Tutte,
*The dichromatic polynomial* - R. M. Wilson,
*Decompositions of complete graphs into subgraphs isomorphic to a given graph* - E. M. Wright,
*The asymptotic enumeration of unlabelled graphs*

W. T. Tutte was unable to give his talk.

Published in: Proceedings of the Fifth British Combinatorial Conference. Edited by C. St.J. A. Nash-Williams and J. Sheehan. Congressus Numerantium, No. XV. Utilitas Mathematica Publishing, Inc., Winnipeg, Man., 1976. viii+96 pp. ISBN-10: 0-919628-15-X, ISBN-13: 978-0-919628-15-1

Royal Holloway College, London, 11-15 July 1977

209 participants.

- F. Buekenhout,
*What is a subspace?* - Peter J. Cameron,
*Extensions of designs: variations on a theme* - J. Conway,
*Graphical Games with Pieces* - P. W. Kasteleyn,
*Phases on Countable Graphs* - L. Lovász,
*Flats in matroids and geometric graphs* - D. K. Ray-Chaudhuri,
*Combinatorial characterization theorems for geometric incidence structures* - N. J. A. Sloane,
*Binary codes, lattices and sphere-packing* - A. T. White,
*Graphs of groups on surfaces* - D. R. Woodall,
*Zeros of chromatic polynomials*

Published in: Combinatorial Surveys. Edited by Peter J. Cameron. Academic Press, London/New York, 1977. vii+226 pp. ISBN-10: 0-12-157150-5, ISBN-13: 978-0-12-157150-4

The talks by J. Conway and P. W. Kasteleyn do not appear in this volume.

University of Cambridge, 13-17 August 1979

159 participants.

- N. L. Biggs,
*Resonance and reconstruction* - A. Gardiner,
*Symmetry conditions in graphs* - D. J. Kleitman,
*Extremal hypergraph problems* - W. Mader,
*Connectivity and edge-connectivity in finite graphs* - Vojtech Rödl (speaker) and Jaroslav Nesetril,
*Partition theory and its applications* - J. J. Seidel,
*Strongly regular graphs* - J. A. Thas,
*Geometries in finite projective and affine spaces* - Carsten Thomassen,
*Long cycles in digraphs with constraints on the degrees* - Dominic Welsh,
*Colouring problems and matroids*

Vojtech Rödl was unable to attend.

Published in: Surveys in Combinatorics. Edited by Béla Bollobás. London Mathematical Society Lecture Note Series, 38. Cambridge University Press, Cambridge, 1979. vii+261 pp. ISBN-10: 0-521-22846-8, ISBN-13: 978-0-521-22846-6

University College, Swansea, 20-24 July 1981

86 participants.

- László Babai,
*On the abstract group of automorphisms* - Lowell W. Beineke,
*A tour through tournaments or bipartite and ordinary tournaments: a comparative survey* - Béla Bollobás,
*Random graphs* - R. L. Graham (speaker) and F. R. K. Chung,
*Recent results in graph decompositions* - F. J. MacWilliams,
*Some connections between designs and codes* - Fred Piper (speaker) and Henry Beker,
*Shift register sequences* - R. W. Robinson,
*Counting graphs with a duality property* - G. C. Shephard (speaker) and Branko Grünbaum,
*The geometry of planar graphs* - John G. Thompson,
*Ovals in a projective plane of order 10*

John G. Thompson was unable to attend.

Published in: Combinatorics. Edited by H. N. V. Temperley. London Mathematical Society Lecture Note Series, 52. Cambridge University Press, Cambridge, 1981, reissued 2007. iii+190 pp. ISBN-10: 0-521-28514-3, ISBN-13: 978-0-521-28514-8

University of Southampton, 11-15 July 1983

182 participants.

- J.-C. Bermond (speaker), J. Bond, M. Paoli and C. Peyrat,
*Graphs and interconnection networks: diameter and vulnerability* - J. M. Hammersley,
*The friendship theorem and the love problem* - J. W. P. Hirschfeld,
*Maximum sets in finite projective spaces* - C. C. Lindner,
*Quasigroup identities and orthogonal arrays* - A. Schrijver,
*Bounds on permanents, and the number of 1-factors and 1-factorizations of bipartite graphs* - J. Sheehan,
*Redfield discovered again* - Ernest Shult,
*Characterizations of the Lie incidence geometries* - V. T. Sós,
*Irregularities of partitions: Ramsey theory, uniform distribution* - R. P. Stanley,
*GL(n,C) for combinatorialists*

Published in: Surveys in Combinatorics. Edited by E. Keith Lloyd. London Mathematical Society Lecture Note Series, 82. Cambridge University Press, Cambridge, 1983. xi+256 pp. ISBN-10: 0-521-27552-0, ISBN-13: 978-0-521-27552-1

University of Glasgow, 22-26 July 1985

173 participants.

- George E. Andrews,
*Combinatorics and Ramanujan's "lost" notebook* - Jozsef Beck,
*Irregularities of distribution and combinatorics* - H. J. Beker,
*Adaptive algorithms for communications* - G. R. Grimmett,
*Random flows: network flows and electrical flows through random media* - A. J. Hoffman,
*On greedy algorithms that succeed* - C. St.J. A. Nash-Williams,
*Detachments of graphs and generalised Euler trails*(The Richard Rado lecture) - P. D. Seymour (speaker) and Neil Robertson,
*Graph minors---a survey* - J. Tits,
*On building buildings* - J. H. van Lint,
*{0,1,*} distance problems in combinatorics*

H. J. Beker was unable to attend. His talk was delivered by E. V. Stansfield.

Published in: Surveys in Combinatorics, 1985. Edited by Ian Anderson. London Mathematical Society Lecture Note Series, 103. Cambridge University Press, Cambridge, 1985. vi+173 pp. ISBN-10: 0-521-31524-7, ISBN-13: 978-0-521-31524-1

The talk by J. Tits does not appear in this volume.

Goldsmiths College, London, 13-17 July 1987

260 participants.

- A. Barlotti,
*Finite geometries and designs* - P. J. Cameron,
*Portrait of a typical sum-free set* - V. Chvátal,
*Perfect graphs* - Paul Erdős,
*My joint work with Richard Rado*(The Richard Rado lecture) - Peter Frankl,
*The shifting technique in extremal set theory* - E. C. Milner (speaker) and K. Prikry,
*Almost disjoint sets* - V. Rödl (speaker) and R. L. Graham,
*Numbers in Ramsey theory* - Andrew Thomason,
*Random graphs, strongly regular graphs and pseudorandom graphs* - Peter Winkler,
*The metric structure of graphs: theory and applications*

Published in: Surveys in Combinatorics, 1987. Edited by C. Whitehead. London Mathematical Society Lecture Note Series, 123. Cambridge University Press, Cambridge, 1987. vii+226 pp. ISBN-10: 0-521-34805-6, ISBN-13: 978-0-521-34805-8

University of East Anglia, Norwich, 3-7 July 1989

260 participants.

- E. F. Assmus, Jr.,
*On the theory of designs* - R. A. Bailey,
*Designs: mappings between structured sets* - Walter A. Deuber,
*Developments based on Rado's dissertation "Studien zur Kombinatorik"*(The Richard Rado lecture) - Jean Doyen,
*Designs and automorphism groups* - A. M. Frieze,
*On matchings and Hamilton cycles in random graphs* - Roland Häggkvist,
*Decompositions of complete bipartite graphs* - Colin McDiarmid,
*On the method of bounded differences* - L. Teirlinck,
*On the use of regular arrays in the construction of t-designs* - Herbert S. Wilf,
*The "snake oil" method for proving combinatorial identities*

Published in: Surveys in Combinatorics, 1989. Edited by Johannes Siemons. London Mathematical Society Lecture Note Series, 141. Cambridge University Press, Cambridge, 1989. viii+217 pp. ISBN-10: 0-521-37823-0, ISBN-13: 978-0-521-37823-9

University of Surrey, Guildford, 8-12 July 1991

201 participants.

- J. A. Bondy,
*A graph reconstructor's manual* - Zoltan Füredi,
*Turan type problems*(The Richard Rado lecture) - S. W. Golomb,
*Construction of signals with favourable correlation properties* - G. Korchmáros,
*Old and new results on ovals in finite projective planes* - I. G. Macdonald,
*Schubert polynomials* - Rudolf Mathon,
*Computational methods in design theory* - Jaroslav Nesetril (speaker) and Martin Loebl,
*Fast and slow growing (a combinatorial study of unprovability)* - Oliver Pretzel,
*Orientations and edge functions on graphs* - P. Rowlinson,
*Graph perturbations*

Published in: Surveys in Combinatorics, 1991. Edited by A. D. Keedwell. London Mathematical Society Lecture Note Series, 166. Cambridge University Press, Cambridge, 1991. vi+300 pp. ISBN-10: 0-521-40766-4, ISBN-13: 978-0-521-40766-3

Edited by D. R. Woodall.

University of Keele, 5-9 July 1993

208 participants.

- Noga Alon,
*Restricted colorings of graphs*(The Richard Rado lecture) - Aart Blokhuis,
*Polynomials in finite geometries and combinatorics* - Graham Brightwell,
*Models of random partial orders* - András Frank,
*Applications of submodular functions* - Anthony J. W. Hilton (speaker) and Jerzy Wojciechowski,
*Weighted quasigroups* - A. A. Ivanov,
*Graphs with projective subconstituents which contain short cycles* - Bill Jackson,
*On circuit covers, circuit decompositions and Euler tours of graphs* - Michael E. Saks,
*Slicing the hypercube* - D. R. Stinson,
*Combinatorial designs and cryptography*

Published in: Surveys in Combinatorics, 1993. Edited by Keith Walker. London Mathematical Society Lecture Note Series, 187. Cambridge University Press, Cambridge, 1993. vi+287 pp. ISBN-10: 0-521-44857-3, ISBN-13: 978-0-521-44857-4

Edited by D. R. Woodall, I. Anderson, J. W. P. Hirschfeld, J. Sheehan and A. G. Thomason.

University of Stirling, 3-7 July 1995

235 participants.

- C. D. Godsil,
*Euclidean geometry of distance regular graphs* - Ray Hill,
*Searching with lies* - François Jaeger,
*Spin models for link invariants* - Mark Jerrum,
*Computational Polya theory* - László Lovász (speaker) and Peter Winkler,
*Mixing of random walks and other diffusions on a graph*(The Richard Rado lecture) - Alexander Lubotzky,
*Cayley graphs: eigenvalues, expanders and random walks* - A. Rosa (speaker) and T. S. Griggs,
*Large sets of Steiner triple systems* - Edward Spence,
*Construction and classification of combinatorial designs* - Joel Spencer,
*Modern probabilistic methods in combinatorics*

Edward Spence was unable to attend. His talk was replaced by:

- Willem Haemers,
*Eigenvalues and regularity of graphs*

Published in: Surveys in Combinatorics, 1995. Edited by Peter Rowlinson. London Mathematical Society Lecture Note Series, 218. Cambridge University Press, Cambridge, 1995. viii+231 pp. ISBN-10: 0-521-49797-3, ISBN-13: 978-0-521-49797-8

The talk by Willem Haemers does not appear in this volume.

Edited by D. R. Woodall, I. Anderson, J. W. P. Hirschfeld, J. Sheehan and C. A. Whitehead.

Queen Mary and Westfield College, London, 7-11 July 1997

320 participants.

- J. H. Conway,
*M*_{13} - Keith Edwards,
*The harmonious chromatic number and the achromatic number* - Clement Lam,
*Computer construction of block designs* - Cheryl E. Praeger,
*Finite quasiprimitive graphs* - B. A. Reed,
*Tree width and tangles: a new connectivity measure and some applications* - Alexander Schrijver,
*Minor-monotone graph invariants* - T. Szőnyi,
*Some applications of algebraic curves in finite geometry and combinatorics* - William T. Trotter,
*New perspectives on interval orders and interval graphs* - Dominic Welsh,
*Approximate counting*(The Richard Rado lecture)

Published in: Surveys in Combinatorics, 1997. Edited by R. A. Bailey. London Mathematical Society Lecture Note Series, 241. Cambridge University Press, Cambridge, 1997. xiv+338 pp. ISBN-10: 0-521-59840-0, ISBN-13: 978-0-521-59840-8

Edited by D. R. Woodall, I. Anderson, G. R. Brightwell, J. W. P. Hirschfeld, P. Rowlinson, J. Sheehan and D. H. Smith.

University of Kent at Canterbury, 12-16 July 1999

260 participants.

- Simeon Ball,
*Polynomials in finite geometries* - Charles Colbourn (speaker), Jeff Dinitz and Doug Stinson,
*Applications of combinatorial designs to communications, cryptography and networking* - Martin Dyer (speaker) and Catherine Greenhill,
*Random walks on combinatorial objects* - Klaus Metsch,
*Bose-Burton type theorems for finite projective, affine and polar spaces* - János Pach,
*Geometric graph theory* - Robin Thomas,
*Recent excluded minor theorems for graphs* - Carsten Thomassen,
*Parity, cycle space and K*_{4}-subdivisions in graphs - W. T. Tutte,
*The Coming of the Matroids*(The Richard Rado lecture) - Nick Wormald,
*Models of random regular graphs*

Published in: Surveys in Combinatorics, 1999. Edited by J. D. Lamb and D. A. Preece. London Mathematical Society Lecture Note Series, 267. Cambridge University Press, Cambridge, 1999. x+298 pp. ISBN-10: 0-521-65376-2, ISBN-13: 978-0-521-65376-3

- Brendan McKay,
`*nauty*`

- Brendan McKay,
*The Bible codes: Fact or Fallacy*

Edited by D. R. Woodall, R. A. Bailey, K. J. Edwards, T. S. Griggs, E. K. Lloyd and C. J. H. McDiarmid.

Conference website (from the Internet Archive)

University of Sussex, Brighton, 2-6 July 2001

222 participants.

- M. Aigner,
*The Penrose polynomial of graphs and matroids*(The Richard Rado Lecture) - I. Anderson,
*Some cyclic and 1-rotational designs* - A. R. Calderbank (speaker) and A. F. Naguib,
*Orthogonal designs and third generation wireless communication* - L. A. Goldberg,
*Computation in permutation groups: counting and randomly sampling orbits* - B. Mohar,
*Graphs on surfaces and graph minors* - M. S. O. Molloy,
*Thresholds for colourability and satisfiability in random graphs and boolean formulae* - J. G. Oxley,
*The interplay between graphs and matroids* - J. A. Thas,
*Ovoids, spreads and m-systems of finite classical polar spaces* - D. R. Woodall,
*List colourings of graphs*(The Nash-Williams Memorial Lecture)

Published in: Surveys in Combinatorics, 2001. Edited by J. W. P. Hirschfeld. London Mathematical Society Lecture Note Series, 288. Cambridge University Press, Cambridge, 2001. x+301 pp. ISBN-10: 0-521-00270-2, ISBN-13: 978-0-521-00270-7

Edited by D. R. Woodall, D. Bedford, A. R. Camina, K. J. Edwards, T. S. Griggs, and A. G. Thomason.

Conference website (from the Internet Archive)

University of Wales, Bangor, 30 June - 4 July 2003

190 participants.

- Lars Andersen (speaker) and C. A. Rodger,
*Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgamations* - Simon Blackburn,
*Combinatorial schemes for protecting digital content* - Alexandre Borovik,
*Matroids and Coxeter groups* - Pavol Hell,
*Algorithmic aspects of graph homomorphisms* - Dieter Jungnickel (speaker) and Dina Ghinelli,
*Finite projective planes with a large abelian group* - Imre Leader,
*Partition Regular Equations*(The Richard Rado Lecture) - Arun Ram (speaker) and Kendra Nelsen,
*Kostka-Foulkes poylnomials and Macdonald spherical functions*(The Littlewood Anniversary Lecture) - Anne Penfold Street (speaker), D. M. Donovan, E. S. Mahmoodian and
C. Ramsay,
*Defining sets in combinatorics: a survey* - Günter Ziegler (speaker) and Volker Kaibel,
*Counting lattice triangulations*

Published in: Surveys in Combinatorics 2003. Edited by C. D. Wensley. London Mathematical Society Lecture Note Series, 307. Cambridge University Press, Cambridge, 2003. vii+370 pp. ISBN-10: 0-521-54012-7, ISBN-13: 978-0-521-54012-4

Edited by D. R. Woodall, F. K. Bell, K. J. Edwards, T. S. Griggs, and S. Perkins.

University of Durham, 11-15 July 2005

Organised jointly with the Open University

240 participants.

- Ben Green,
*Finite field models in additive combinatorics* - Oliver King,
*The subgroup structure of finite classical groups in terms of geometric configurations* - Patric Östergård,
*Constructing combinatorial objects via cliques* - Tim Penttila,
*Flocks of circle planes* - Alex Scott,
*Judicious partitions and related problems*(The Richard Rado Lecture) - Oriel Serra,
*An isoperimetric method for the small subset problem* - Paul Seymour (speaker) and Maria Chudnovsky,
*The structure of claw-free graphs* - Alan Sokal,
*The multivariate Tutte polynomial (alias Potts model) for graphs and matroids* - Angelika Steger (speaker) and Stefanie Gerke,
*The sparse regularity lemma and its applications*

Published in: Surveys in Combinatorics 2005. Edited by B. S. Webb. London Mathematical Society Lecture Note Series, 327. Cambridge University Press, Cambridge, 2005. vii+258 pp. ISBN-10: 0-521-61523-2, ISBN-13: 978-0-521-61523-5

Edited by F. K. Bell, K. J. Edwards, T. S. Griggs, J. van den Heuvel, S. Perkins, and B. S. Webb.

University of Reading, 9-13 July 2007

224 participants.

- Béla Bollobás,
*Hereditary properties of combinatorial structures*(The Richard Rado lecture) - Richard A. Brualdi,
*Ordering classes of matrices of 0's and 1's* - Darryn Bryant,
*Cycle decompositions of complete graphs* - Maria Chudnovsky,
*Excluding induced subgraphs* - Mike Grannell and Terry Griggs,
*Designs and topology* - Johan Håstad,
*On the efficient approximability of constraint satisfaction problems* - James Hirschfeld,
*The number of points on an algebraic curve over a finite field* - Keith Martin,
*The combinatorics of cryptographic key management* - Stéphan Thomassé,
*Branchwidth of graphic matroids*

Published in: Surveys in Combinatorics 2007. Edited by A. J. W. Hilton and J. Talbot. London Mathematical Society Lecture Note Series, 346. Cambridge University Press, Cambridge, 2007. vii+286 pp. ISBN-13: 978-0-521-69823-8

Edited by K. J. Edwards, T. S. Griggs, J. van den Heuvel, S. Perkins, B. S. Webb and V. Zverovich.

University of St. Andrews, 6-10 July 2009

260 participants.

- Arrigo Bonisoli,
*Graph decompositions and symmetry* - Peter J. Cameron (speaker) and Rosemary Bailey,
*Combinatorics and optimal block designs* - Willem H. Haemers,
*Regularity and the spectra of graphs* - Gholamreza B. Khosrovshahi (speaker) and B. Tayfeh-Rezaie,
*Trades and t-designs* - Alexandr V. Kostochka (speaker), H. A. Kierstead and Gexin Yu,
*Extremal graph packing problems: Ore-type versus Dirac-type* - Daniela Kühn (speaker) and Deryk Osthus,
*Embedding large graphs into dense graphs* - Marc Noy (speaker) and Omer Giménez,
*Counting planar graphs and related families of graphs* - Oliver Riordan (speaker) and Béla Bollobás,
*Metrics for Sparse Graphs (talk title: Inhomogeneous random graphs)* - Gordon Royle,
*Recent results on the chromatic and flow roots of graphs and matroids*

Published in: Surveys in Combinatorics 2009. Edited by S. Huczynska, J. D. Mitchell and C. M. Roney-Dougal. London Mathematical Society Lecture Note Series, 365. Cambridge University Press, Cambridge, 2009. vii+327 pp. ISBN-13: 978-0-521-74173-6

Edited by K. J. Edwards, J. van den Heuvel, S. Perkins, J. Talbot, B. S. Webb and V. Zverovich.

Conference website (from the Internet Archive).

University of Exeter, 4-8 July 2011

158 participants.

- Mireille Bousquet-Mélou,
*Counting planar maps, coloured or uncoloured* - Paul Goldberg,
*A survey of PPAD-completeness for computing Nash equilibria* - Peter Keevash,
*Hypergraph Turán problems* - Vlado Nikiforov,
*Some new results in extremal graph theory* - Bruce Sagan,
*The cyclic sieving phenomenon* - Koen Thas,
*Order in building theory* - Andrew Thomason,
*Graphs, colours, weights and hereditary properties* - Mark Walters,
*Random geometric graphs*(The Richard Rado lecture) - Ian Wanless,
*Transversals in latin squares*

Published in: Surveys in Combinatorics 2011. Edited by Robin Chapman. London Mathematical Society Lecture Note Series, 392. Cambridge University Press, Cambridge, 2011. vii+437 pp. ISBN-13: 978-1-107-60109-3

Edited by K. J. Edwards, J. van den Heuvel, S. Perkins, B. S. Webb and V. Zverovich.

Conference website is no longer available.

Royal Holloway, University of London, 1-5 July 2013

150 participants.

- Jacob Fox (speaker) and David Conlon,
*Graph removal lemmas* - Massimo Giulietti,
*The geometry of covering codes: small complete caps and saturating sets in Galois spaces* - Tor Helleseth (speaker) and Alexander Kholosha,
*Bent functions and their connection to combinatorics* - Jan van den Heuvel,
*The complexity of change* - Jozef Širáň,
*How symmetric can maps on surfaces be?* - Einar Steingrímsson,
*Some open problems on permutation patterns* - Kristina Vušković,
*The world of hereditary graph classes viewed through Truemper configurations* - Geoff Whittle (speaker), Jim Geelen and Bert Gerards,
*Structure in minor-closed classes of matroids*(The Richard Rado Lecture) - Doron Zeilberger,
*Automatic counting of tilings of skinny plane regions*

Published in: Surveys in Combinatorics 2013. Edited by Simon Blackburn, Stefanie Gerke and Mark Wildon. London Mathematical Society Lecture Note Series, 409. Cambridge University Press, Cambridge, 2013. vii+384 pp. ISBN-13: 978-1-107-65195-1

University of Warwick, 6-10 July 2015

168 participants.

- Manuel Bodirsky,
*Ramsey Classes: Examples and Constructions*(The Richard Rado Lecture) - David Conlon (speaker), Jacob Fox and Benny Sudakov,
*Recent developments in graph Ramsey theory* - Stefanie Gerke (speaker) and Paul Balister,
*Controllability and matchings in random bipartite graphs* - Gil Kalai,
*Some old and new problems in combinatorial geometry I: Around Borsuk's problem* - Tomasz Łuczak,
*Randomly generated groups* - Gary McGuire (speaker) and Omran Ahmadi,
*Curves over finite fields and linear recurring sequences* - Sergey Norin,
*New tools and results in graph minor structure theory* - Nik Ruškuc (speaker) and Sophie Huczysnka,
*Well quasi-order in combinatorics: embeddings and homomorphisms* - Chaoping Xing (speaker) and Liming Ma,
*Optimal rate algebraic list decoding of folded algebraic geometry codes*

Published in: Surveys in Combinatorics 2015. Edited by Artur Czumaj, Agelos Georgakopoulos, Daniel Král', Vadim Lozin and Oleg Pikhurko. London Mathematical Society Lecture Note Series, 424. Cambridge University Press, Cambridge, 2015. vii+324 pp. ISBN-13: 978-1-107-46250-2

University of Strathclyde, 3-7 July 2017

168 participants.

- Rosemary Bailey,
*Relations among partitions* - Julia Böttcher,
*Large-scale structures in random graphs* - William Chen,
*The spt-function of Andrews* - Antonio Cossidente,
*Combinatorial structures in finite classical polar spaces,* - Daniel Horsley,
*Switching techniques for edge decompositions of graphs* - Vít Jelínek,
*Ramsey-type problems in permutations*(The Richard Rado Lecture) - Robert Morris,
*Monotone cellular automata* - Benny Sudakov,
*Robustness of graph properties* - Julia Wolf,
*Some applications of relative entropy in additive combinatorics*

Antonio Cossidente was unable to attend. His talk was replaced by:

- Gi-Sang Cheon,
*New applications of Riordan arrays*

Published in: Surveys in Combinatorics, 2017. Edited by Anders Claesson, Mark Dukes, Sergey Kitaev, David Manlove and Kitty Meeks. London Mathematical Society Lecture Note Series, 440. Cambridge University Press, Cambridge, 2017. vii+442 pp. ISBN: 978-0-108-41313-8

The talk by Gi-Sang Cheon does not appear in this volume.

- Graham Farr,
*W. T. Tutte: Graph theory as he had grown it*

List of mini-symposium talks and contributed talks

University of Birmingham, 29 July - 2 August 2019

235 participants.

- Penny Haxell,
*Topological connectedness and independent sets in graphs*(The Richard Rado Lecture) - Daniel Král' (speaker) and Andrzej Grzesik,
*Analytic representations of large graphs* - Michael Krivelevich,
*Expanders - how to find them, and how to use them*(The Clay Lecture) - Kristin Lauter (speaker) and Christophe Petit,
*Supersingular isogeny graphs in cryptography (or how to keep your secrets in a post-quantum world)* - Hendrik Van Maldeghem (speaker) and Magali Victoor,
*Combinatorial constructions of exceptional buildings* - Iain Moffatt,
*From graph duals to matrix pivots: a tour through delta-matorids* - Igor Pak,
*Counting linear extensions and Young tableaux* - Daniël Paulusma (speaker), Konrad Dabrowski and Matthew Johnson,
*Clique-width for hereditary graph classes* - Gábor Tardos,
*The extremal theory of vertex or edge ordered graphs*

Published in: Surveys in Combinatorics, 2019. Edited by Allan Lo, Richard Mycroft, Guillem Perarnau and Andrew Treglown. London Mathematical Society Lecture Note Series, 456. Cambridge University Press, Cambridge, 2019. vii+265pp. ISBN: 978-1-108-74072-2

The talk by Igor Pak does not appear in this volume.

List of mini-symposium talks and contributed talks

Alphabetical list of invited speakers

Online, organised by University of Durham, 5-9 July 2021

427 participants.

- Karim Adiprasito,
*The partition complex: an invitation to combinatorial commutative algebra* - Daniele Bartoli,
*Hasse-Weil type theorems and relevant classes of polynomial functions* - Marthe Bonamy,
*Decomposing the edges of a graph into simpler structures* - Catherine Greenhill,
*Generating graphs randomly* - Martin Grohe,
*Recent advances on the graph isomorphism problem* - Deryk Osthus,
*A proof of the Erdős-Faber-Lovász conjecture* - Oleg Pikhurko,
*Borel combinatorics*(The Richard Rado Lecture) - Cheryl Praeger,
*Codes and designs in Johnson graphs*(The Clay Lecture) - Colva Roney-Dougal,
*Base sizes and relational complexity of finite permutation groups*

Published in: Surveys in Combinatorics, 2021. Edited by Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios and Daniël Paulusma. London Mathematical Society Lecture Note Series, 470. Cambridge University Press, Cambridge, 2021. viii+370pp. ISBN: 978-1-009-01888-3

List of mini-symposium talks and contributed talks

University of Lancaster, 11-15 July 2022

- Noga Alon,
*Fair partitions*(The Clay Lecture) - József Balogh (speaker), Felix Christian Clemen and Bernard Lidický,
*Hypergraph Turán problems in l_2-norm* - Irit Dinur,
*Expanders and codes*(The Richard Rado Lecture) - David Ellis,
*Intersection problems in extremal combinatorics* - Valentina Pepe,
*Finite geometry and extremal graph theory* - Alexey Pokrovskiy,
*Rainbow subgraphs and their applications* - László Végh (speaker), Farbod Ekbatani and Bento Natura,
*Linear programming and the circuit imbalance measure* - Paul Wollan,
*Explicit bounds in graph minors* - Josephine Yu,
*Combinatorics of tropical geometry*

Published in: Surveys in Combinatorics, 2022. Edited by Anthony Nixon and Sean Prendiville. London Mathematical Society Lecture Note Series, 481. Cambridge University Press, Cambridge, 2022. vii+247pp. ISBN: 978-1-009-09622-5

The talk by Irit Dinur does not appear in this volume.

List of mini-symposium talks and contributed talks

Alphabetical list of invited speakers

Note that the lists of contributed talks are only approximations to the truth; they were compiled from the books of abstracts and whatever other information was available.

Please email me if you know of any errors in this list.

I would like to thank all those who provided information for this list.

*Keith Edwards
Updated 16 July 2022*