27th British Combinatorial Conference
University of Birmingham, 29 July - 2 August 2019

Mini-symposium on Additive Combinatorics:

• Oliver Janzer, Polynomial bound for the partition rank vs the analytic rank of tensors
• Sofia Lindqvist, Rado's criterion for squares and higher powers
• Oriol Serra, Sumsets in several dimesions
• Sophie Stevens, Distinct distances in finite fields

Mini-symposium on Designs and Latin Squares:

• R. A. Bailey, Substitutes for the non-existent square lattice designs for $36$ treaments
• Sergey Goryainov, On strictly Neumaier graphs
• Peter Keevash, Designs and decompositions
• Michael Kinyon, Latin set-theoretic solutions of the quantum Yang-Baxter equation
• Maura Paterson, Design Theory and Unconditionally Secure Authentication
• Ian Wanless, Generalised transversals of Latin squares

Mini-symposium on Extremal Combinatorics:

• Peter Allen, A robust Corrádi-Hajnal Theorem
• Julia Böttcher, Universality for bounded degree spanning trees in randomly perturbed graphs
• David Conlon, On the Brown-Erdős-Sós problem
• Shoham Letzter, Hypergraph Lagrangians

Mini-symposium on Graph Colouring:

• Marthe Bonamy, Revisiting a theorem by Folkman on graph colouring
• Jan van den Heuvel, What can we do with the number of colours Hadwiger's Conjecture gives us?
• Ross J. Kang, Fractional colouring and the hard-core model
• Luke Postle, On Local and MAD Versions of Reed's Conjecture

Mini-symposium on Probabilistic Combinatorics:

• Matija Bucić, Covering random graphs by monochromatic trees and Helly-type results for hypergraphs
• Stefanie Gerke, Successive shortest paths in complete graphs with random edge weights
• Matthew Jenssen, Independent sets in the hypercube revisited
• Joonkyung Lee, Odd cycles in subgraphs of sparse pseudorandom graphs

Mini-symposium on Ramsey Theory:

• Andrzej Dudek, Long monochromatic paths in random graphs
• Stefan Glock, Rainbow Spanning Tree Decompositions
• András Gyárfás, Some new variations on the Ramsey theme
• Alexey Pokrovskiy, Increasing paths in edge-ordered graphs

Contributed talks:

• Angela Aguglia, On non-singular Hermitian varieties of $PG(4,q^2)$
• Bogdan Alecu, Graph Functionality
• Michael Anastos, Finding perfect matchings in random regular graphs in linear expected time
• Pedro Antonio, An interpretation for the Tutte polynomial at (2,-1)
• Hilda Assiyatun, The connected size Ramsey number for matchings versus small disconnected graphs
• Wanyok Atisattapong, Wang-Landau sampling for estimation of the reliability of physical networks
• Aistis Atminas, Characterising inflations of monotone grid classes of permutations
• Maria Axenovich, Clumsy packings of graphs
• Simeon Ball, On varieties defined by the intersection of many quadrics
• Ben Barber, The Namer-Claimer game
• Edy Tri Baskoro, On the Ramsey number for trees versus wheels of small order
• Natalie C. Behague, Hypergraph Saturation Irregularities
• Simon R. Blackburn, The minimum Manhattan distance of a permutation
• Maarten De Boeck, Intriguing sets in projective and polar geometries
• Alexander Bors, Finite groups with few automorphism orbits relative to their number of element orders
• Candida Bowtell, Maximum hittings by maximal left-compressed intersecting families
• Simona Boyadzhiyska, On counting problems related to orthogonal Latin squares
• Joseph Briggs, Rainbow independent sets in proper classes
• Benjamin Merlin Bumpus, The width of minimum cost tree decompositions
• Andrea Burgess, Cyclic cycle systems of the complete multipartite graph
• Stijn Cambie, VC dimension and a union theorem for set systems
• Peter J. Cameron, Hall-Paige and synchronization
• Nicholas J. Cavenagh, Heffter arrays with compatible and simple orderings
• Debsoumya Chakraborti, Minimizing the number of copies of $K_r$ in a $K_s$-saturated graph
• Jonathan Chapman, Ramsey Numbers of Brauer Configurations
• Demetres Christofides, New graphs of high girth and high chromatic number
• Sylwia Cichacz, Realization of digraphs in Abelian groups
• Padraig Condon, Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
• Matthew Coulson, The critical window in random digraphs
• Vedrana Mikulić Crnković, Weakly self-orthogonal designs and related codes
• Konrad K. Dabrowski, Graph isomorphism for $(H_1,H_2)$-free Graphs: An~almost complete dichotomy
• Clément Dallard, A complexity dichotomy of colourful components problems in $k$-caterpillars and small-degree planar graphs
• Nicholas Day, Maker-Breaker percolation games
• Corey DeGagné, On reliability roots of simplicial complexes and matroids.
• Michelle Delcourt, The Glauber dynamics for edges colorings of trees
• Alberto Espuny Díaz, Dirac's theorem for random regular graphs
• Natasha Dobrinen, Ramsey theory on infinite graphs
• Ryan E. Dougherty, On a property of perfect hash families
• Zdeněk Dvořák, 3-choosability of planar graphs of girth at least five, using the discharging method
• Stefan Ehard, A rainbow blow-up lemma for almost optimally bounded edge-colourings
• Clive Elphick, Spectral bounds for graph parameters - Part I
• Jessica Enright, Firebreaking: one-shot fire control on a graph
• Khawaja M. Fahd, MST of the Inner dualist of honeycomb graphs
• Graham Farr, Some problems suggested by the Online Graph Atlas project
• Joanna B. Fawcett, Tree-homogeneous graphs
• Tony Forbes, Group Divisible Designs with Block Size 4
• Eric M. Freden, From EDT0L grammars to generating functions
• Yuichiro Fujiwara, Codes for correcting erasures with sporadic errors
• Maximilien Gadouleau, Linear Programming complementation and its application to fractional graph theory
• David Galvin, Independent set permutations and matching permutations
• Frederik Garbe, Limits of Sequences of Latin Squares
• Alexander Gavrilyuk, Digraphs with Hermitian spectral radius at most $2$
• Mani Ghahremani, On monotonicity of minimum cost inert node searching
• Robert Hancock, Some results in 1-independent percolation
• John Haslegrave, Spanning surfaces in $3$-uniform hypergraphs
• Saaknder Hayat, A spectral characterization of the $s$-clique extension of the square grid graphs
• Karl Heuer, Progress on the Ubiquity Conjecture
• A.J.W. Hilton, Cruse's theorem for partial symmetric $(\nu, \ldots, \nu_n)$-Latinized squares
• J. W. P. Hirschfeld, Open problems in finite projective spaces
• Eng Keat Hng, Minimum degree conditions for powers of cycles and paths
• I-Chiau Huang, A new approach to residues
• Joseph Hyde, A degree sequence Komlós theorem
• Kittitat Iamthong, Word-representability of split graphs generated by morphisms
• Khajee Jantarakhajorn, Connectivity of non-commuting graphs for finite rings
• Mark Jerrum, Some more recent applications of partial rejection sampling
• Robert Johnson, Correlation for permutations
• Ben Jones, Excluded minors for classes of binary functions
• Fatma Karaoglu, The number of cubic surfaces with 27 lines over a finite field
• Tom Kelly, Fractional coloring with local demands
• Rachel Kirsch, Many cliques with few edges
• Gal Kronenberg, The maximum length of $K_r$-Bootstrap Percolation
• Ander Lamaison, Ramsey upper density of infinite graphs
• Richard Lang, Asymptotically good local list edge colourings
• Jie Ma, Cycle lengths in graphs of given minimum degree and chromatic number
• Trent G. Marbach, Covers and partial transversals of Latin squares
• David Marchant, The growth of the Möbius function on the permutation poset
• Tatsuya Maruta, On the extendability of quaternary linear codes
• Kitty Meeks, Choose your own adventure in parameterised graph algorithms
• Criel Merino, Counting spanning trees on the graph's complement
• Tamás Mészáros, Separating tree-chromatic number from path-chromatic number
• Akshat Mudgal, Sums of linear transformations in higher dimensions
• Augustine O. Munagi, Combinatory classes of compositions with higher-order conjugation
• Émile Nadeau, Enumeration of permutation classes by inflation of independent sets of graphs
• Tomoki Nakamigawa, The expansion of a chord diagram and the Genocchi numbers
• Shunsuke Nakamura, Contractible edges on longest cycles in a 3-connected graph
• Tomas Nilson, Intercalates in double and triple arrays
• Tony Nixon, Global rigidity of linearly constrained frameworks
• Cian O'Brien, Alternating signed bipartite graph colourings
• Zoe O'Connor, Census coverage adjustment methodology
• Matt Ollis, Sequences in groups with distinct partial products
• Viresh Patel, Zero-free regions of graph polynomials and computational counting
• Yanitsa Pehova, An approximate version of Jackson's conjecture
• Ignacio M. Pelayo, Graphs with power domination at most 2
• Vincent Pfenninger, Monochromatic cycle partitioning
• David A. Pike, Connectivity in hypergraphs
• Oleg Pikhurko, Measurable version of Vizing's theorem
• François Pirot, Fractional chromatic number, maximum degree and girth
• William Raynaud, Smallest cyclically covering subspaces of $\mathbb{F}_q^n$
• Zahid Raza, The edge metric dimension of Cayley graphs $\Gamma(\Z_n\oplus \Z_2)$ and its Barycentric Subdivisions
• Sanja Rukavina, New extremal Type II $\mathbb{Z}_4$-codes of length 32 obtained from Hadamard designs
• Jess Ryan, Subgraph counting in practice
• Andrew Ryzhikov, Mortality and synchronization in unambiguous automata
• Akira Saito, Distance matching extension in star-free graphs
• Alia Sajjad, Ranking connected block designs on A-optimality criterion using concurrence and Levi graphs; a unified approach
• Nika Salia, The Structure of connected hypergraphs without long Berge paths
• Nicolás Sanhueza-Matamala, Partitioning $2$-coloured complete $3$-graphs into two monochromatic tight cycles
• Anneleen De Schepper, Projective planes with polar spaces
• Keisuke Shiromoto, The critical problem for binary matroids
• Rinovia Simanjuntak, Multiset dimensions of trees
• Anna Skelt, Prime strictly concentric magic squares
• Jason P. Smith, The poset of graphs ordered by induced containment
• Katherine Staden, The generalised Oberwolfach problem
• Srinibas Swain, An introduction to the Online Graph Atlas
• David Tankus, Recognizing Generating Subgraphs
• Shoichi Tsuchiya, Difference of forbidden pairs containing a claw
• Yu Tsunoda, Bound for $(r,w]$-consecutive-disjunct matrices
• Mykhaylo Tyomkyn, The Brown-Erdős-Sós conjecture in groups
• Rémi de Joannis de Verclos, Chordal graphs are easily testable
• Máté Vizer, Ramsey numbers of edge-ordered graphs
• Guanghui Wang, Rainbow Hamiltonian cycles
• Ping Wang, Strong chromatic index of $K_4$-minor free graph
• Yun Wang, Disjoint cycles in a digraph with partial degree
• Cat Wedderburn, Burn, baby, burn: Mathematical firefighting to reduce potential disease spread
• Pawel Wocjan, Spectral bounds for graph parameters - Part II
• Jin Yan, A proof of a conjecture on disjoint cycles in tournaments
• Gökhan Yıldırım, Longest increasing subsequences in random pattern-avoiding permutations
• Kiyoshi Yoshimoto, Structures of edge colored complete bipartite graphs without proper colored cycles of specified length
• Xiaowei Yu, Antimagic labeling of biregular bipartite graphs
• Oscar Zamora, The structure of hypergraphs without long Berge cycles
• Noam Zeilberger, A proof-theoretic analysis of the rotation lattice of binary trees
• Wenling Zhou, Rainbow matchings in edge-colored graphs with given average color degree

Back to the British Combinatorial Conferences page.