28th British Combinatorial Conference
Online, organised by University of Durham, 5-9 July 2021

Mini-symposium on Designs and Latin squares:

• Peter J. Cameron, Diagonal semilattices and their graphs
• Nicholas Cavenagh, Mutually Orthogonal Frequency Squares
• Peter Dukes, A lower bound on HMOLS
• Liana Yepremyan, Ryser's conjecture and more

Mini-symposium on Probabilistic combinatorics:

• Andreas Galanis, Counting solutions in the random k-SAT model
• Alexander E. Holroyd, Local Colouring
• Tobias Müller, Nonconvergence in the first order logic of permutations
• Leonardo T. Rolla, Oriented percolation with modified boundaries

Mini-symposium on Graph colouring:

• Louis Esperet, Clustered colouring of planar graphs
• Chính T. Hoàng, Dichotomizing k-vertex-critical H-free graphs for H of order four
• Sophie Spirkl, Excluding a tree and a biclique
• Nicolas Trotignon, Burling graphs revisited

Mini-symposium on Extremal combinatorics:

• Michelle Delcourt, Progress towards Nash-Williams' conjecture on triangle decompositions
• Anita Liebenau, Sidorenko systems of equations
• Natasha Morrison, Uncommon systems of equations
• Olaf Parczyk, Spanning subgraphs in randomly perturbed graphs

Mini-symposium on Codes and cryptography:

• Lilya Budaghyan, On optimal cryptographic Boolean functions
• Michael Kiermaier, On divisible linear codes
• Siaw-Lynn Ng, Distributed storage systems and finite geometry
• Douglas Stinson, On Security Properties of All-or-nothing Transforms

Mini-symposium on Temporal graphs:

• Kitty Meeks, Interval-membership-width: a purely temporal parameter
• Hendrik Molter, Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
• Nils Morawietz, A Temporal Chase Is Harder Than You Think
• Amitabh Trehan, Distributed Algorithms over Temporal Networks?

Contributed talks:

• Santiago Barrera Acevedo, Cocyclic two-circulant core Hadamard matrices.
• Bogdan Alecu, Between Monotone and Geometric Griddability of Permutation Classes and Beyond
• James Alex, F-Perfect Graphs
• Saeid Alikhani, Vertex stability and edge stability for the chromatic index of graphs
• Awss Alogaidi, Large Arcs in Small Planes
• Michael Anastos, On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time
• I Wayan Palton Anuwiksa, The Multipartite-Size Ramsey Number of Complete Bipartite Graphs
• Robert F. Bailey, On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher
• Ben Barber, Small sums of five roots of unity
• Paul Bastide, Burning giant sequoias
• Natalie C. Behague, Synchronizing Times for k-sets in Automata
• Alistair Benford, Trees in tournaments
• Benjamin Aram Berendsohn, An exact characterization of saturation for permutation matrices
• Anton Betten, Del Pezzo Surfaces of Rank Two over Finite Fields
• Ez-Zobair Bidine, Chromatic identities on maximal triangle-free graphs
• Anurag Bishnoi, The minimum degree of minimal Ramsey graphs for cliques
• Simon R. Blackburn, How many finite rings are there?
• Jan Bok, Acyclic, Star and Injective Colouring for H-free graphs
• Candida Bowtell, Matchings in k-partite k-graphs
• Simona Boyadzhiyska, Hyperplane coverings with multiplicities
• Samuel Braunfeld, Counting substructures of highly symmetric structures
• Benjamin Merlin Bumpus, Spined Categories: generalising tree-width beyond graphs
• Yudhistira A. Bunjamin, Group divisible designs with block size 4 and group sizes divisible by 3
• Asier Calbet, The number of locally p-stable functions on Qn
• Zhi Yee Chng, On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs
• Suchakree Chueluecha, The Sunflower Problem
• Dennis Clemens, Ramsey simplicity of random graphs
• Dan Cocks, Uncountably many minimal hereditary classes of graphs of unbounded clique-width
• Alberto Espuny Díaz, Path decompositions of random directed graphs
• Kamal Dliou, L(2,1)-number of the Mycielski of graphs
• Calina Durbac, Best Response Dynamics on Random Graphs
• M. Reza Emamy-K From Convexity to Threshold Logic with Lattices on the Path
• Joshua Erde, Large complete minors in random subgraphs
• Aysel Erey, Maximizing the distance spectral radius of graphs
• Hossein Teimoori Faal, Iterated Integrals of Clique Polynomials
• Raúl M. Falcón, A new Latin square isomorphism invariant arisen from fractal image patterns
• Giovanni Falcone, Permutations of zerosum sets
• Tony Forbes, Generalized pentagonal geometries
• Andrea Freschi, On deficiency problems for graphs
• Shoni Gilboa, The maximal number of 3-term arithmetic progressions in finite sets in different geometries
• Martin Charles Golumbic, Containment graphs and posets of paths in a tree
• Bertille Granet, Path decompositions of tournaments
• B.L. Granovsky, Explicit asymptotic formulae for multiplicative combinatorial sructures.
• He Guo, Bounds on Ramsey Games via Alterations
• Pranshu Gupta, minimal ramsey graphs with many vertices of small degree
• Akshay Gupte, On Stability Number and Chromatic Number of Markovian Random Graphs
• Robert Hancock, Towards characterising locally common graphs
• Claire Hilaire, Grid Major of Graph Drawings
• Paola Tatiana P. Huaynoca, Conflict-free coloring game
• Glenn Hurlbert, On intersecting families of independent sets in trees
• Joseph Hyde, Towards the 0-statement of the Kohayakawa-Kreuter Conjecture
• Bill Jackson, Maximal Matroids in Weak Order Posets
• Robert Johnson, Voronoi Games on the Discrete Hypercube
• Ohr Kadrawi, A Linear Algorithm for Computing Independence Polynomials of Trees
• Hamed Karami, Perfect Colorings of Generalized Petersen Graphs
• Amarja Kathapurkar, Spanning trees in dense directed graphs
• Atsuya Kato, On the Construction of Optimal Linear Codes from Hyperbolic Quadrics
• Daiki Kawabata, On the Nonexistence of Ternary Griesmer Codes
• Tom Kelly, Hamilton transversals in random Latin squares
• Alaittin Kırtığoşlu, Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
• Sergey Kitaev, Distribution of mesh patterns
• Alexander Kolpakov, Space vectors forming rational angles
• Mike Krebs, Finite epsilon-unit distance graphs
• Matjaž Krnc, Graphs with two moplexes are more than perfect
• Jan Kurkofka, The Farey graph
• Domenico Labbate, Extending perfect matchings to Hamiltonian cycles in line graphs
• Craig Larson, New Results on alpha-critical Graphs
• Florian Lehner, Improved bounds on the cop number of a graph drawn on a surface
• Tuomo Lehtilä, Location-Domination in Binary Hamming Spaces: An Improved Lower Bound
• Thomas Lesgourgues, Minimum degree of asymmetric Ramsey-minimal graphs
• Christian Lindorfer, The language of self-avoiding walks, part II
• Alexei Lisitsa, An experimental approach to Gauss diagram realizability
• Laila Loudiki, diameter of a generalization of generalized petersen graphs
• Vadim Lozin, Tree-width dichotomy
• Kyle MacKeigan, Orthogonal Colourings of Random Graphs
• Sonwabile Mafunda, On Proximity and Remoteness in Graphs and Digraphs
• Roghayeh Maleki, Four Dimensional Association Schemes Have Cyclotomic Character Values
• E.C.M. Maritz, A note on the covering dimension of a graph
• Arturo Merino, Efficient generation of elimination trees and Hamilton paths on graph associahedra
• Criel Merino, The critical group of orientable ribbon graphs
• Peleg Michaeli, Discrepancies of Spanning Trees
• Mirjana Mikalaćki, The Toucher-Isolator game
• Meysam Miralaei, On the size-Ramsey number of grid graphs
• Iain Moffatt, Irreducibility and Tutte polynomials of graphs in surfaces
• Andrea Munaro, Width parameters and graph classes: the case of mim-width
• Maya Nabila, Some Ramsey (C_4,K_1,n)-minimal graphs
• Tássio Naia, Orientation Ramsey thresholds
• Tomoki Nakamigawa, On the Multiplicity of a Nonintersecting Chord Diagram Generated by Chord Expansions
• Namrata, On Hamilton Cycles in Kneser Graphs
• Steven Noble, Series-Parallel Delta-Matroids
• Cian O'Brien Alternating sign hypermatrices and Latin-like squares
• Giacomo Paesani, Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs
• Silvia M.C. Pagani, Power sum polynomials and the ghosts behind them
• Matteo Parisi, The m=2 amplituhedron and the hypersimplex: signs, clusters, triangulations, Eulerian numbers
• Kalen Patton, Prague Dimension of Random Graphs
• Francesco Pavese, Small complete caps in PG(4n+1,q)
• Marco Pavone, Additive and strongly additive block designs
• Vincent Pfenninger, The Ramsey number for 4-uniform tight cycles
• Devi Imulia Dian Primaskun, A better upper bound of the locating-chromatic number of trees
• Daniel Quiroz, Clique immersions and independence number
• Sarobidy Razafimahatratra, On the Erdos-Ko-Rado theorem for transitive groups
• Muhammad Ridwan, Some graphs of order n with dominating partition dimension n-3
• Rikayanti, Algorithm for Computing the Total Vertex Irregularity Strength of the Generalized Petersen Graphs
• Sanja Rukavina, On some recent results on 2-(v,k,lambda) symmetric designs with small lambda
• Sarang Sadawarte, Directed Cordial Labeling of Some Graphs
• Nika Salia, Posa-type results for Berge Hypergraphs
• Shohei Satake, On the RIP of Paley ETF and related combinatorial results
• Irene Sciriha, Graphs Reconstructible from One Card and a One-Dimensional Eigenspace
• Thomas Selig, Combinatorial aspects of Abelian and stochastic sandpile models on complete graphs
• Mahsa N. Shirazi, on weakly hadamard diagonalizable graphs
• Riste Škrekovski, On 12-regular nut graphs
• Souad Slimani, Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs
• Katherine Staden, The Erdos-Rothschild problem
• Dudley Stark, Component Counts of Random Injections
• Andrea Švob, Distance-regular graphs obtained from the Mathieu groups and new block designs
• John Sylvester, Tangled Paths: A Random Graph Model from Mallows Permutations
• Jane Tan, Reconstructing trees from small cards
• Anna Taranenko, On transversals, near transversals, and diagonals in iterated groups and quasigroups
• Henry (Maya) Robert Thackeray, The cap set problem: standard diagrams and new proofs
• Maya Thompson, A Tutte Polynomial for Embedded Graphs
• Yozef Tjandra, Permutation-Generated Maps on Dyck Paths
• Olivier Togni, Choosability with Separation of Cycles and Outerplanar Graphs
• Andrew Treglown, Colour-bias problems for dense graphs
• Ludmila Tsiovkina, Covers of complete graphs and related association schemes
• James Tuite, Turan problems for k-geodetic digraphs
• S. Venkitesh, Covering Symmetric Subsets of the Boolean Boolean cube with Affine Hyperplanes
• Ian Wanless, Omniversal Latin squares
• Lutz Warnke, The jump of the clique chromatic number of random graphs
• Belinda Wickes, Shattering with Permutations
• Wolfgang Woess, The language of self-avoiding walks, part I
• Xinyi Xu, Partial colouring of graphs: What to do if you don't have enough colours?
• Viktor Zamaraev, Sharp Thresholds in Random Temporal Graphs
• Soukaina Zayat, Erdos-Hajnal conjecture for Galaxies with Spiders
• Giovanni Zini, Moore polynomial sets over finite fields
• Majid Zohrehbandian, New insight into introducing a (2-epsilon)-approximation ratio for minimum vertex cover problem
• Zulfaneti, The corona product of two graphs on n vertices with the metric-location-domination number n/2
• Ferdinando Zullo, Scattered polynomials and their exceptionality
• Vadim Zverovich, Prevalence of Braess' Paradox?

Back to the British Combinatorial Conferences page.