Conference presentations

• Graph decompositions in random settings, Shanks Workshop on Combinatorics and Graph Theory 2024. (slides)
• Robustness for hypergraph embeddings via spreadness, Atlanta Lecture Series 2023. (slides)
• Robustness via spreadness, CanaDAM 2023. (slides)
• A proof of the Erdős-Faber-Lovász conjecture, Oberwolfach 2022 workshop on Graph Theory. (slides)
• Hamilton transversals in random Latin squares, BCC 2021. (slides)
• A proof of the Erdős-Faber-Lovász conjecture, CanaDAM 2021. (slides)
• Fractional coloring with local demands, BCC 2019. (slides)
• Fractional coloring with local demands, CanaDAM 2019. (talk abstract)
• Bounding χ by a fraction of ∆ for graphs without large cliques, ICGT 2018. (slides)
• Bounding the chromatic number by a fraction of the maximum degree for graphs with no large cliques, SIAM DM '18. (talk abstract)
• A local epsilon version of Reed's conjecture, Eurocomb 2017. (Extended Abstract)
• Beyond degree-choosability toward a local version of Reed’s ω, ∆, χ conjecture, CanaDAM 2017. (slides)
• Large induced forests in planar and subcubic graphs of girth 4 and 5, SIAM DM '16. (slides)

Recorded seminars and colloquia

• Coloring hypergraphs of small codegree, and a proof of the Erdős-Faber-Lovász conjecture, Institut Teknologi Bandung, Indonesia, Combinatorics Today Series. (slides)
• Coloring hypergraphs of small codegree, and a proof of the Erdős-Faber-Lovász conjecture, The Matroid Union, Graphs and Matroids Seminar. (slides)
• Rainbow Hamilton paths in random 1-factorizations of K_n, LaBRI, Bordeaux, Graphs and Optimization seminar. (slides)
• A proof of the Erdős-Faber-Lovász conjecture, University of Waterloo, Tutte colloquium. (slides)