| Chair: P. J. Cameron, MS.02 |
| 10:30 - 10:50 |
D. B. Penman
Comparable pairs and linear extensions in partially ordered sets |
| 10:55 - 11:15 |
J. B. Fawcett
Locally triangular graphs and rectagraphs with symmetry
|
| 11:20 - 11:40 |
M. Ellingham
Link graphs and an unexpected application of topological graph theory |
| 11:45 - 12:05 |
A. Bishnoi
The Alon-Füredi bound |
|
| Chair: F. Skerman, MS.03 |
| 10:30 - 10:50 |
J. Haslegrave
Searching for a hidden moving target |
| 10:55 - 11:15 |
N. Georgiou
Hat guessing on graphs: solvability and criticality |
| 11:20 - 11:40 |
G. E. Farr
The probabilistic method meets Go |
| 11:45 - 12:05 |
W. E. Tan
Probabilistic Intuition in Waiter-Client and Client-Waiter games |
|
| Chair: D. Bevan, MS.04 |
| 10:30 - 10:50 |
M. Lee
Relative m-covers of generalised quadrangles |
| 10:55 - 11:15 |
M. Tannock
Pattern avoidance and non-crossing subgraphs of polygons |
| 11:20 - 11:40 |
T. Popiel
Point-primitive generalised polygons |
| 11:45 - 12:05 |
D. V. Chopra
On the existence and the maximum number of constraints for some combinatorial arrays |
|
| Chair: S. Noble, B3.02 |
| 10:30 - 10:50 |
N. E. Clarke
Skolem labellings of generalized Dutch windmills |
| 10:55 - 11:15 |
P. Gordinowicz
Cops, robbers and ordinals |
| 11:20 - 11:40 |
J. Foniok
Applications of adjoint functors in graph theory |
| 11:45 - 12:05 |
A. Castillo-Ramirez
Memoryless computation and universal simulation |
|
