Skip to main content

Tuesday program

The 25th British Combinatorial Conference

Tuesday program

08:50 - 09:00 Welcome, MS.02
Vadim Lozin
09:00 - 09:55 Stefanie Gerke (Chair: Vadim Lozin), MS.02
Controllability and matchings in random bipartite graphs
10:00 - 10:30 Coffee break
10:30 - 12:05 Contributed talks (4 slots) in 4 parallel sessions
Rooms MS.02, MS.03, MS.04, B3.02
12:05 - 02:00 Lunch
02:00 - 02:55 Tomasz Łuczak (Chair: Artur Czumaj), MS.02
Randomly generated groups
03:00 - 03:30 Coffee break
03:30 - 04:40 Contributed talks (3 slots) in 4 parallel sessions
Rooms MS.02, MS.03, MS.04, B3.02
05:00 - 06:00 BCC Business Meeting, MS.02
07:30 - ... BCC concert, Rootes Building, Chancellors Suite
(Rootes Building is 55 on the campus map)

Tuesday morning contributed talks

Chair: A. Treglown, MS.02
10:30 - 10:50 S. Noble
Delta-matroids, ribbon graphs and connectivity
10:55 - 11:15

A. Liebenau
First order convergence of matroids

11:20 - 11:40 E. Csoka
Generalized solution for the Herman Protocol Conjecture
11:45 - 12:05 P. Borg
Cross-intersecting families
Chair: P. Allen, MS.03
10:30 - 10:50 J. Bottcher
Chromatic thresholds in random graphs
10:55 - 11:15 T. A. McCourt
Face 2-coloured triangulations and directed Eulerian digraphs on the sphere
11:20 - 11:40 J. van den Heuvel
Generalised colouring numbers of graphs
11:45 - 12:05 C. Ciftci
Local connective chromatic number of a graph
Chair: V. Falgas-Ravry, MS.04
10:30 - 10:50 B. Atay
Exponential domination number of cycle related graphs
10:55 - 11:15 K. Meeks
Graph modication problems in epidemiology
11:20 - 11:40 G. Boruzanli
On reliability of the generalized Petersen graphs
11:45 - 12:05 G. Hurlbert
On computing graph pebbling numbers
Chair: T. S. Griggs, B3.02
10:30 - 10:50 R. J. Stones
Counting partial Latin rectangles
10:55 - 11:15 N. Cavenagh
Which Latin square is the loneliest?
11:20 - 11:40 I. M. Wanless
Symmetries of Latin Squares
11:45 - 12:05 A. J. W. Hilton
Completing y-uniform latinized squares

Tuesday afternoon contributed talks

Chair: J. Bottcher, MS.02
03:30 - 03:50 K. Markstrom
Turan densities for 3-graphs
03:55 - 04:15

P. Hu
Mantel's theorem for random hypergraphs

04:20 - 04:40 F. Joos
The Erdős–Pósa property for cycles
Chair: J. Haslegrave, MS.03
03:30 - 03:50 I. Karpas
Families avoiding just one pattern
03:55 - 04:15 C. Bean
Avoiding a pair of vincular and covincular patterns
04:20 - 04:40 K. Wesek
Grasshopper pattern avoidance
Chair: B. Walczak, MS.04
03:30 - 03:50 C. A. Rodger
Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
03:55 - 04:15 R. Freij
Warmth and connectivity of edge spaces of graphs
04:20 - 04:40 T. Johansson
On random k-out subgraphs of large graphs
Chair: A. Liebenau, B3.02
03:30 - 03:50 E. Zamaraeva
On k-threshold functions
03:55 - 04:15 A. Kisielewicz
A conjecture of Clote and Kranakis
04:20 - 04:40 A. Burgess
On the Hamilton-Waterloo Problem with odd orders