Schedule

All times below are given in New Zealand Daylight Time (UTC + 13).

Invited speakers are indicated in bold and speakers eligible for the CMSA Anne Penfold Street Student Prize are indicated by an (S) following their name.

This schedule is subject to change.

• 1115: Welcome
• 1130: Richard Nowakowski Advances in Indifference: new frontiers in combinatorial game theory
• 1230: Felipe Hernandez-Lorenzana Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
• 1300: Carlos Vilchis-Alfaro Dynamic paths and cycles in H-colored multigraphs
• 1330: Yusuf Hafidh (S) Locating Chromatic Number of Infinite Trees Slides

• 1730: Chuanqi Zhang (S) Connections between graphs and matrix spaces Slides
• 1800: Thomas Lesgourgues (S) On the use of senders for asymmetric tuples of cliques in Ramsey Theory
• 1830: Thomas Selig The stochastic sandpile model on complete graphs Slides
• 1900: Marni Mishna Kernel Dynamics: Towards a combinatorial understanding of transcendental functions

• 1000: Maciej Ulas There are infinitely many Hilbert cubes of dimension 3 in the set of squares
• 1030: Alexander Kolpakov Three-dimensional maps and subgroup growth Slides
• 1100: Lara Pudwell Engaging students in combinatorics research Slides
• 1200: Ofelia Cepeda-Camargo Twins and Semitwins in Digraphs
• 1230: Ian Wanless Mutually orthogonal binary frequency squares

• 1500: Nicholas Cavenagh Row-column factorial designs of strength at least 2
• 1530: Yudhistira A. Bunjamin (S) Finding group divisible designs with and without automorphisms
• 1600: Daniel Horsley Block avoiding sequencings of Steiner systems Slides
• 1630: Samuel Barton (S) Hypergraph Models with Application

• 1800: Jack Neubecker (S) Almost resolvable when duplicated Steiner triple systems
• 1830: Jeremy Mitchell (S) An Infinite Family of Connected 1-Factorisations of Complete 3-Uniform Hypergraphs
• 1900: Pablo Spiga From the existence of graphical regular representations to their asymptotic enumeration
• 2000: Aidan Gentle (S) A polynomial construction of perfect sequence covering arrays
• 2030: Yuxuan Li (S) The second largest eigenvalue of normal Cayley graphs on symmetric groups generated by cycles

• 1000: Marija Maksimović Orbit matrices and strongly regular graphs
• 1030: Bartosz Sobolewski The number of colored binary partitions as a sum of three squares
• 1100: Peter Nelson Linear, quadratic and exponential growth in matroid classes
• 1200: Francisco Javier de Vega On the DPC partitions of a number Slides
• 1230: Vindya Warnakulasooriyage (S) Generalized Hadamard Matrices and Generalized Hadamard Graphs
• 1300: David Glynn Making Subatomic Particles and Atoms from Blank Pieces of Paper Slides

• 1500: Günter Steinke Kleinewillinghöfer types of finite Laguerre planes with at least 3 linearly transitive groups of G-translations
• 1530: Jack Allsop (S) Cycle lengths of 1-factorisations of complete graphs and complete bipartite graphs
• 1600: Simone Linz Parameterised algorithms to compute distances between phylogenetic trees
• 1700: Koji Imamura (S) Critical Problem for a q-analogue of polymatroids
• 1730: Robert Hickingbotham (S) Product structure of graph classes with bounded treewidth
• 1800: Stephen Glasby An application of the Expander Mixing Lemma

• 1000: Krystian Gajdzica Beyond the log-concavity of the restricted partition function
• 1030: Rajko Nenadov Probabilistic intuition and small subgraph games
• 1100: Padraig Ó Catháin The Hadamard maximal determinant problem Slides
• 1200: Announcement of CMSA Anne Penfold Street Student Prize