Program and Abstracts CanaDAM 2021 The Canadian Discrete and Algorithmic Mathematics Conference 2021.canadam.math.ca May 25 – May 28, 2021 This program was generated on: May 19, 2021 Table of Contents List of Abbreviations 1 Plenary Talks 3 Invited Minisymposia 4 Contributed Minisymposia 5 Contributed Talks 6 Schedule Overview 7 Detailed Daily Schedule – Tuesday May 25 8 Detailed Daily Schedule – Wednesday May 26 11 Detailed Daily Schedule – Thursday May 27 15 Detailed Daily Schedule – Friday May 28 18 Detailed Daily Schedule – by Session 22 Abstracts 40 Plenary Speakers 40 IM1: Combinatorial Optimization - Part I 43 IM2: Invitation to distributed graph algorithms 45 CM1: Algebraic and Combinatorial Approaches to Designs and Codes - Part I 47 CM2: Arithmetic Combinatorics - Part I 49 CM3: Chemical Graph Theory - Part I 51 CM4: Computational proof techniques for combinatorics on words 53 CM5: Extremal problems for hypergraphs 55 CM6: Graph Searching 57 CT1: Random graphs 59 IM3: Approximation Algorithms 61 CM7: Algebraic and Combinatorial Approaches to Designs and Codes - Part II 63 CM8: Chemical Graph Theory - Part II 65 CM9: Cycles in Planar Graphs 67 CM10: Graph Product Structure Theory 69 CM11: Movement and symmetry in graphs - Part I 71 CT2: Broadcasting and Domination 73 CT3: Spectral graph theory and distance-regular graphs 75 IM4: Discrete Geometry 77 IM5: Extremal Combinatorics 79 IM6: In honour of Pavol Hell - Part I 81 IM7: Invitation to Sparsity 83 CM12: Algebraic and Combinatorial Approaches to Designs and Codes - Part III 85 CM13: Arithmetic Combinatorics - Part II 87 CM14: Chemical Graph Theory - Part III 89 CM15: The Metric Dimension of a Graph and its Variants - Part I 91 CT4: Hamiltonicity 93 CT5: Scheduling and Algorithms 95 IM8: Combinatorial Optimization - Part II 97 IM9: Discrete and algorithmic mathematics in biology and epidemiology - Part I 99 IM10: In honour of Pavol Hell - Part II 101 CM16: Average Graph Parameters - Part I 103 CM17: Graph Polynomials - Part I 105 CM18: Recent aspects of sphere packings - Part I 107 CT6: Game Theory 109 CT7: Graph Colouring I 111 CT8: Patterns and Compositions 113 CT9: Polynomials and groups 115 IM11: Discrete and algorithmic mathematics in biology and epidemiology - Part II 117 IM12: Generating series and confined lattice walks - Part I 119 CM19: Coherent configurations with few fibers - Part I 121 CM20: Spectral Graph Theory - Part I 123 CM21: The Metric Dimension of a Graph and its Variants - Part II 125 CT10: Arithmetic Combinatorics 127 CT11: Hypergraphs 129 CT12: Orientations 131 CT13: Potage of algorithmic designs 133 CT14: Structures in Graphs 135 IM13: Combinatorics on Posets - Part I 137 IM14: Invitation to Reconfiguration - Part I 139 IM15: Probabilistic Approaches 141 CM22: Coherent configurations with few fibers - Part II 143 CM23: Graph Polynomials - Part II 145 CM24: New Trends in Analytic Combinatorics 147 CM25: Recent aspects of sphere packings - Part II 149 CT15: Graph Colouring II 151 CT16: Structural Graph Theory 153 PIL: Public Interest Lecture 155 IM16: Combinatorics on Posets - Part II 156 IM17: Generating series and confined lattice walks - Part II 158 CM26: Algorithms for interval graphs and related families - Part I 160 CM27: Flow polytopes of graphs 162 CM28: Graph Colouring – surfaces, homomorphisms, and distinguishing 164 CM29: Movement and symmetry in graphs - Part II 166 CM30: Practical Applications of Design Theory - Part I 168 CM31: Spectral Graph Theory - Part II 170 CT17: Contributed Talks II 172 IM18: Invitation to Reconfiguration - Part II 174 IM19: Structural Graph Theory 176 CM32: Algorithms for interval graphs and related families - Part II 178 CM33: Average Graph Parameters - Part II 180 CM34: Enumerative and Extremal Graph Theory 182 CM35: Practical Applications of Design Theory - Part II 184 CT18: Contributed Talks I 186 CT19: Contributed Talks III 188 CT20: Flows and signed graphs 190 CT21: Posets and lattices 192 Talk List in Order of Speaker’s Last Name 194 1 List of Abbreviations CM = Contributed Minisymposium CT = Contributed Talk IM = Invited Minisymposium SM = Special Minisymposium PIL Public Interest Lecture Plenary Plenary Speakers CM1 Algebraic and Combinatorial Approaches to Designs and Codes - Part I CM2 Arithmetic Combinatorics - Part I CM3 Chemical Graph Theory - Part I CM4 Computational proof techniques for combinatorics on words CM5 Extremal problems for hypergraphs CM6 Graph Searching CM7 Algebraic and Combinatorial Approaches to Designs and Codes - Part II CM8 Chemical Graph Theory - Part II CM9 Cycles in Planar Graphs CM10 Graph Product Structure Theory CM11 Movement and symmetry in graphs - Part I CM12 Algebraic and Combinatorial Approaches to Designs and Codes - Part III CM13 Arithmetic Combinatorics - Part II CM14 Chemical Graph Theory - Part III CM15 The Metric Dimension of a Graph and its Variants - Part I CM16 Average Graph Parameters - Part I CM17 Graph Polynomials - Part I CM18 Recent aspects of sphere packings - Part I CM19 Coherent configurations with few fibers - Part I CM20 Spectral Graph Theory - Part I CM21 The Metric Dimension of a Graph and its Variants - Part II CM22 Coherent configurations with few fibers - Part II CM23 Graph Polynomials - Part II CM24 New Trends in Analytic Combinatorics CM25 Recent aspects of sphere packings - Part II CM26 Algorithms for interval graphs and related families - Part I CM27 Flow polytopes of graphs CM28 Graph Colouring – surfaces, homomorphisms, and distinguishing CM29 Movement and symmetry in graphs - Part II CM30 Practical Applications of Design Theory - Part I CM31 Spectral Graph Theory - Part II CM32 Algorithms for interval graphs and related families - Part II CM33 Average Graph Parameters - Part II CM34 Enumerative and Extremal Graph Theory CM35 Practical Applications of Design Theory - Part II CT1 Random graphs CT2 Broadcasting and Domination CT3 Spectral graph theory and distance-regular graphs CT4 Hamiltonicity CT5 Scheduling and Algorithms CT6 Game Theory CT7 Graph Colouring I CT8 Patterns and Compositions CT9 Polynomials and groups CT10 Arithmetic Combinatorics CT11 Hypergraphs Back to Table of Contents 2 CT12 Orientations CT13 Potage of algorithmic designs CT14 Structures in Graphs CT15 Graph Colouring II CT16 Structural Graph Theory CT17 Contributed Talks II CT18 Contributed Talks I CT19 Contributed Talks III CT20 Flows and signed graphs CT21 Posets and lattices IM1 Combinatorial Optimization - Part I IM2 Invitation to distributed graph algorithms IM3 Approximation Algorithms IM4 Discrete Geometry IM5 Extremal Combinatorics IM6 In honour of Pavol Hell - Part I IM7 Invitation to Sparsity IM8 Combinatorial Optimization - Part II IM9 Discrete and algorithmic mathematics in biology and epidemiology - Part I IM10 In honour of Pavol Hell - Part II IM11 Discrete and algorithmic mathematics in biology and epidemiology - Part II IM12 Generating series and confined lattice walks - Part I IM13 Combinatorics on Posets - Part I IM14 Invitation to Reconfiguration - Part I IM15 Probabilistic Approaches IM16 Combinatorics on Posets - Part II IM17 Generating series and confined lattice walks - Part II IM18 Invitation to Reconfiguration - Part II IM19 Structural Graph Theory Back to Table of Contents 3 Plenary Talks Schedule Tuesday May 25 10:00 - 11:00 László Végh (London School of Economics), The circuit imbalance measure and its role in linear program- ming (p. 40) 14:10 - 15:10 Natasha Morrison (University of Victoria), Uncommon systems of equations (p. 40) Wednesday May 26 10:00 - 11:00 Yufei Zhao (Massachusetts Institute of Technology), Extremal problems in discrete geometry (p. 40) 14:10 - 15:10 Caroline Colijn (Simon Fraser University), Mathematics and policy in the COVID-19 pandemic (p. 41) Thursday May 27 10:00 - 11:00 Mireille Bousquet-Mélou (CNRS, Université de Bordeaux), Counting lattice walks confined to cones (p. 41) 14:10 - 15:10 William T. Trotter (Georgia Tech University), Posets with Planar Cover Graphs (p. 41) Friday May 28 14:10 - 15:10 Sergey Norin (McGill University), Recent progress towards Hadwiger’s conjecture (p. 42) Back to Table of Contents 4 Invited Minisymposia Topic Date Time IM1 Combinatorial Optimization - Part I Tuesday May 25 11:20 - 13:45 IM2 Invitation to distributed graph algorithms Tuesday May 25 11:20 - 13:45 IM3 Approximation Algorithms Tuesday May 25 15:30 - 17:55 IM4 Discrete Geometry Wednesday May 26 11:20 - 13:45 IM5 Extremal Combinatorics Wednesday May 26 11:20 - 13:45 IM6 In honour of Pavol Hell - Part I Wednesday May 26 11:20 - 13:45 IM7 Invitation to Sparsity Wednesday May 26 11:20 - 13:45 IM8 Combinatorial Optimization - Part II Wednesday May 26 15:30 - 17:55 IM9 Discrete and algorithmic mathematics in biology and epidemiology - Part I Wednesday May 26 15:30 - 17:25 IM10 In honour of Pavol Hell - Part II Wednesday May 26 15:30 - 17:55 IM11 Discrete and algorithmic mathematics in biology and epidemiology - Part II Thursday May 27 11:20 - 13:15 IM12 Generating series and confined lattice walks - Part I Thursday May 27 11:20 - 13:15 IM13 Combinatorics on Posets - Part I Thursday May 27 15:30 - 17:55 IM14 Invitation to Reconfiguration - Part I Thursday May 27 15:30 - 17:55 IM15 Probabilistic Approaches Thursday May 27 15:30 - 17:55 IM16 Combinatorics on Posets - Part II Friday May 28 11:20 - 13:15 IM17 Generating series and confined lattice walks - Part II Friday May 28 11:20 - 13:15 IM18 Invitation to Reconfiguration - Part II Friday May 28 15:30 - 17:55 IM19 Structural Graph Theory Friday May 28 15:30 - 17:55 Back to Table of