Timothy F. N. Chan

Hiya! I recently completed my PhD in mathematics at Monash University and the University of Warwick. My supervisors were David Wood and Daniel Kráľ. I received my undergraduate degree from the University of New South Wales in 2016. My current work is focused on discrete mathematics, particularly extremal combinatorics.

I have previously worked at the Astronomy and Space Science division of the CSIRO.

Research Interests:

• Structural measures of combinatorial objects

• Combinatorial limits

• Graph colouring & enumeration

• Applications to operations research

You may have seen me at one of the following events:

• 5th International Combinatorics Conference, Monash (Melbourne), December 2017

• International Research School and Workshop on Graph Limits, Lyon, January 2018

• Graph Limits in Bohemian Switzerland, Czech Republic, March 2018

• Eurocomb 2019, Bratislava, August 2019

Papers:

• Cycles of length three and four in tournaments, with A. Grzesik, D. Král, J. A. Noel, published in Journal of Combinatorial Theory, Series A (2020)

• Characterization of quasirandom permutations by a pattern sum, with D. Král, J. A. Noel, Y. Pehova, M. Sharifzadeh, J. Volec, published in Random Structures & Algorithms (2020)

• Optimal tree-depth of matrices and a row-invariant parametrized algorithm for integer programming, with J. W. Cooper, M. Koutecký, D. Král, K. Pekárková, published in SIAM Journal on Computing (2022)

• Inducibility and universality for trees, with D. Král, B. Mohar, D. R. Wood, published in Combinatorial Theory (2022)

I have reviewed articles appearing in Discrete Mathematics and SIDMA.

Contact:

• Email: timothy DOT fn DOT chan AT gmail.com