29th British Combinatorial Conference
University of Lancaster, 11-15 July 2022
Mini-symposium on Extremal combinatorics:
- Candida Bowtell,
The n-queens problem
- Noam Lifshitz,
Extremal product free sets in groups
- Richard Montgomery,
On the Ryser-Brualdi-Stein conjecture
- Mathias Schacht,
Extremal problems in hypergraphs with quasirandom links
Mini-symposium on Matroids and combinatorial geometry:
- Daniel Irving Bernstein,
Maximum likelihood thresholds via graph rigidity
- Alex Fink,
Some geometry of delta-matroids
- Georg Grasegger,
Algorithms for counting realisations of minimally rigid graphs
- Shin-ichi Tanigawa,
Global rigidity of triangulated manifolds
Mini-symposium on Designs and algebraic structures:
- R. A. Bailey,
Resistance distance in the context of association schemes and coherent configurations
- Peter J. Cameron,
Finding geometries in the power graphs of simple groups
- Dean Crnković,
Pairwise balanced designs and periodic Golay pairs
- Andrea Švob,
Switching for 2-designs
Mini-symposium on Probabilistic combinatorics:
- Paul Balister,
The k-th shortest path in an edge-weighted Kn
- Stefan Glock,
Hypergraph matchings with(out) conflicts
- Mark Jerrum,
The Ising model on line graphs
- Gal Kronenberg,
Erdős-Renyi shotgun reconstruction
Mini-symposium on Additive combinatorics:
- Freddie Manners,
Quasirandomness for latin squares and counting transversals
- Natasha Morrison,
The typical structure of sets with small sumset
- Akshat Mudgal,
Finding large additive and multiplicative Sidon sets in sets of integers
- Sarah Peluse,
Subsets of F_p^n x F_p^n without L-shaped configurations
Mini-symposium on Induced subgraphs:
- Tara Abrishami,
Induced subgraphs and tree decompositions
- Édouard Bonnet,
An algorithmic weakening of the Erdős-Hajnal conjecture
- Paweł Rzążewski,
Understanding graphs with no long claws
- Michael Savery,
Short induced cycles in planar graphs
Contributed talks:
- Ahmad Abdi,
Some progress on Woodall's Conjecture on packing dijoins in digraphs
- Pedro Araujó,
On the anti-Ramsey threshold for non-balanced graphs
- Natalie Behague,
Subgraphs of semi-random graphs
- Alistair Benford,
Copies of oriented trees with many leaves in tournaments
- David Bevan,
Permutation limits at infinitely many scales
- Peter Borg,
From domination to isolation of graphs
- Simona Boyadzhiyska,
Fixed-point cycles: extremal combinatorics meets social choice theory
- Domagoj Bradač,
Turán numbers of sunflowers
- Asier Calbet,
Triangle saturated graphs with large minimum degree
- Jonathan Chapman,
Partition and density regularity for polynomial systems
- David Munhá Correia,
Erdős's conjecture on the pancyclicity of Hamiltonian graphs
- James Cruickshank,
Symmetric contact systems of segments, pseudotriangulations and inductive constructions for corresponding surface graphs.
- Konrad K. Dabrowski,
Learning small decision trees for data of low rank-width
- Louis DeBiasio,
Monochromatic linear forests
- Sean Dewar,
Quotient graphs of symmetrically rigid frameworks
- Natasha Dobrinen,
Ramsey theory on homogeneous structures
- Nemanja Draganić,
Embedding problems in sparse expanders
- Péter L. Erdős,
The sequence of prime gaps is graphic
- Victor Falgas-Ravry,
On an extremal problem for multigraphs
- Nora Frankl,
Graphs with large minimum degree and no small odd cycles are three-colourable
- Andrea Freschi,
Dirac-type results for tilings and coverings in ordered graphs
- Yuichiro Fujiwara,
Bounds on the estimation error of syndrome-based channel parameter estimation by linear codes
- Maximilien Gadouleau,
Graphs on lattices
- Andrei Gagarin,
Embedding K_3,3 and K_5 on orientable surfaces
- Tomack Gilmore,
Coefficientwise total positivity of some combinatorial matrices
- Pranshu Gupta,
Ramsey equivalence for asymmetric pairs
- Akshay Gupte,
Large independent sets in Markov random graphs
- Ervin Győri,
Subgraph densities in K_r-free graphs
- Daniel Hawtin,
Neighbour-transitive codes in Kneser graphs
- Jan van den Heuvel,
Partial Multi-colourings
- John Hewetson,
Characterising global rigidity in non-euclidean normed planes via matroid connectivity
- A. J. W. Hilton,
Bounds related to the edge-list chromatic and total chromatic numbers of a simple graph
- Hany Ibrahim,
Edge contraction and forbidden induced graphs
- Bill Jackson,
Unique realisations of outerplanar graphs
- J. Robert Johnson,
Optimal resistor networks
- Laura M. Johnson,
An introduction to DPDFs and EPDFs
- Thomas Karam,
Equidistribution of high rank boolean polynomials over F_p
- Eleftherios Kastis,
Braced triangulations and rigidity
- Csaba Király,
Fast algorithms for global rigidity
- Jan Kurkofka,
Canonical graph decompositions via coverings
- Laura Larios-Jones,
Maximising minimum reachability in temporal graphs
- Ambrose Law,
On combinatorial number theory: Sum systems
- Jan Legerský,
Flexibility of Penrose frameworks
- Anna M. Limbach,
On k-fold sums of integer sets Structure and irregularity
- Allan Lo,
Cycle decompositions in k-uniform hypergraphs
- Signe Lundqvist,
When is a rod configuration infinitesimally rigid?
- Sonwabile Mafunda,
On diameter and size in graphs and digraphs
- Sam Mattheus,
Erdős-Ko-Rado for flags in spherical buildings
- Marija Jelić Milutinović,
Cut complexes
- Iain Moffatt,
Acritical group for embedded graphs: working with maps
- Theodore Molla,
Minimium color degree thresholds for rainbow subgraphs
- Patrick Morris,
Maximum running times for graph bootstrap percolation processes
- Alp Müyesser,
A random Hall-Paige conjecture
- Namrata,
Pattern avoiding binary trees
- Steven Noble,
Acritical group for embedded graphs: working with delta-matroids
- Giacomo Paesani,
Classifying subset feedback vertex set for H-free graphs
- Kalina Petrova,
Size-Ramsey numbers of graphs with maximum degree three
- Vincent Pfenninger,
1-independent percolation in Z^2 x K_n
- Simón Piga,
Tight Hamilton cycles in uniformly dense k-uniform hypergraphs
- Oliver Roche-Newton,
Distinct dot products and arithmetic growth
- Bernd Schulze,
Symmetry and the design of self-stressed structures
- Tamás Schwarcz,
Exchange distance of basis pairs in split matroids
- Thomas Selig,
What is a (combinatorial) sandpile?
- Jason Smith,
Asymptotic behaviour of mesh pattern containment
- Bartosz Sobolewski,
Monochromatic arithmetic progressions in binary words associated with pattern sequences
- Leonard H. Soicher,
Software for finding and classifying cliques
- Jack Southgate,
Global area rigidity of generic hypergraph frameworks
- Youri Tamitegama,
Balancing connected colourings of graphs
- Jane Tan,
Touching representations by comparable boxes
- Vladislav Taranchuk,
On a new family of algebraically defined graphs
- Mohabat Tarkeshian,
The geometry of random graphs with a Markov flavour
- Henry (Maya) Robert Thackeray,
Caps up to dimension 7
- Maya Thompson,
Recursively counting flows in embedded graphs
- Lilla Tóthmérész,
h*-vectors of edge polytopes and connections to the greedoid polynomial
- Andrew Treglown,
Complete subgraphs in a multipartite graph
- James Tuite,
Position sets in graphs
- Mykhaylo Tyomkyn,
Monochromatic components with many edges
- Denae Ventura,
Unavoidable patterns in 2-edge colorings of the complete bipartite graph
- Joseph Wall,
Rigidity of symmetric frameworks on the cylinder
- Bridget S. Webb,
More on subsystems of Netto triple systems
- Belinda Wickes,
Separating path systems for the complete graph
- Martin Winter,
(Random) trees of intermediate volume growth exist
- Xinyi Xu,
Towards Stahl's Conjecture: Multi-colouring of Kneser Graphs
- Gökhan Yıldırım,
Enumerating pattern-avoiding inversion sequences: an algorithmic approach based on generating trees
- Mehmet Akif Yıldız,
Hamilton cycles on dense regular digaphs and oriented graphs
- Yacong Zhou,
Small and disjoint quasi-kernels
Back to the British Combinatorial
Conferences
page.