25th Birthday Celebration of  

Fletcher Challenge Theatre, SFU Harbour Centre
Simon Fraser University, Vancouver
Monday 27th May 2019

This is a satellite conference to the 7th Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2019), 28–31 May 2019.
Register as part of your registration for CanaDAM 2019 (faculty $15, postdocs and students $5).

8:30 – 9:00registration, coffee and opening
9:00 – 9:45Francisco SantosClassification of lattice polytopes
9:50 – 10:35Bruce SaganThe protean chromatic polynomial
10:40 – 11:05coffee break
11:10 – 11:55Maya SteinTrees in graphs with large degrees
12:00 – 13:40lunch
13:40 – 14:25Neil Calkin, Fan Chung, Brendan McKay Panel discussion on the history of E-JC
14:30 – 15:15David WoodDefective and clustered graph colouring
15:20 – 15:50coffee break
15:50 – 16:35Catherine GreenhillTwo threshold problems for random graphs and hypergraphs
16:40 – 17:25Miklós BónaMost principal permutation classes have nonrational generating functions
17:30 – 18:30David WoodGeneral discussion on open access journals

Special E-JC minisymposium at CanaDAM, Tuesday 28th May

morning session (Chair: André Kündgen)
Ian WanlessGeneralised transversals of Latin squares
Matthias BeckClassification of combinatorial polynomials (in particular, Ehrhart polynomials of zonotopes)
Ronald GrahamA few of my favorite combinatorial problems
Catherine Yan Vector parking functions with periodic boundaries and rational parking functions
afternoon session (Chair: Michael Giudici)
Bojan MoharCrossing-critical graphs
Fan ChungProblems in spectral graph theory
Zdeněk DvořákOn triangle-free planar graphs
József SolymosiRigidity of planar arrangements

Organisers: Richard A. Brualdi, Bojan Mohar, Bruce Sagan, Maya Stein, David Wood

E-JC gratefully acknowledges the support of the Pacific Institute for the Mathematical Sciences (PIMS) and Simon Fraser University (SFU)