Chair: R. Mycroft, MS.02 
03:30  03:50 
L. Grabowski
Towards a measurable version of Lovász Local Lemma 
03:55  04:15 
A. Treglown
A random version of Sperner's theorem

04:20  04:40 
D. Donovan
Parameter space coverage using Latin Hypercube Sampling 
04:45  05:05 
F. Skerman
Modularity phase transition in Erdős–Rényi random graphs 
05:10  05:30 
L. Montero
Tight lower bounds on the number of bicliques in falsetwinfree graphs 

Chair: S. R. Blackburn, MS.03 
03:30  03:50 
T. S. Griggs
Combinatorics of the sonnet 
03:55  04:15 
I. Makhlin
A combinatorial formula for ane HallLittlewood functions via a weighted Brion Theorem 
04:20  04:40 
R. Scheidweiler
Ehrhart polynomials and the Erdős multiplication table problem 
04:45  05:05 
K. Morgan
Certificates for graph polynomials 

Chair: D. Christofides, MS.04 
03:30  03:50 
D. Horsley
Alspach's cycle decomposition problem for multigraphs 
03:55  04:15 
R. Hoyte
Cycle decompositions of the complete graph with a hole 
04:20  04:40 
E. G. MphakoBanda
Graph compositions: Some 2edge connected graphs and some upper bounds 
04:45  05:05 
M. Merker
Decomposing highly edgeconnected graphs into trees of small diameter 
05:10  05:30 
K. Ehsani
Orientation of graphs with prescribed indegrees and outdegrees 

Chair: J. Przybylo, B3.02 
03:30  03:50 
T. Perrett
A zerofree interval for chromatic polynomials of graphs with 3leaf spanning trees 
03:55  04:15 
D. Quiroz
On the chromatic number of exact distance graphs 
04:20  04:40 
H. GaleanaSanchez
A characterization of panchromatic patterns 
04:45  05:05 
C. Merino
The heterochromatic number of hypergraphs coming from matroid structures 
05:10  05:30 
R. Lang
The list chromatic index of graphs of treewidth 3 and maximum degree at least 7 
