Program

Conference venue: Science Building next to James E. Walker Library

Morning Session on May 13

8:00-8:45       Registration

                         Lobby of the Science Building

8:50-9:00       Opening remarks (Dr. Van Patten, Dean of College of Basic and Applied Sciences)

                         Room: SCI 1006

9:00-9:50      Plenary talk: Yufei Zhao (MIT)

                       Title: Equiangular Lines and Eigenvalues Multiplicities

                       Room: SCI 1006

Time	Room SCI 1190	Room SCI 1191
10:00-10:20	Michael Tiemeyer Nim on Wheels	Linyuan Lu Maximum spread of outerplanar, planar, and -minor-free graphs
0:25-10:45	William Cox Arithmetic Triangles and Pascal-Type Recurrence Relations	Kevin Grace Twist Classes of Delta-Matroids, Cogs, and Whitney Flips
10:45-11:00	Break
11:00-11:20	Bing Wei Bounds for Saturation Numbers of Balanced Double Stars	Amin Bahmanian On Layer-Rainbow Latin Cubes Containing Layer-Rainbow Latin Cubes
11:25-11:45	Kanchana Madhumali Gamlath Esweda Gamladdalage The Independent Bondage Number of Planar Graphs with Minimum Degree at least Three	J. C. SaundersThe Number of -Tons in the Coupon Collector Problem
11:50-12:10	Joshua Lambert Cz-Factorizations of the Multigraph where z=2a and a is even	Isaiah Osborne Sign-Invertibility of Graphs
12:10-1:30	Lunch break (Box lunch provided)

Afternoon Session on May 13

1:30-2:20      Plenary talk: Jingyoung Park (New York University)

                       Title: Counting Homomorphisms from Bipartite Graphs

                       Room: SCI 1006

Time	Room SCI 1190	Room SCI 1191
2:30-2:50	Teddy Mishura Robust Recovery of Robinson -Graphons	James Reid Rooted Prism Minors and Disjoint Cycles Containing a Specified Edge
2:55-3:15	Wenjian Liu (canceled) Bayesian Phylogenetic Inference of Stochastic Block Models on Infinite Trees	Vaidyanathan Sivaraman Forbidden Induced Subgraph Characterizations
3:15-3:30	Break
3:30-3:50	Leonard Mushunjie Topological Manifolds for Statistical Learning	Guangming Jing Density and Edge Colouring
3:55-4:15	Evangelos Nastas On a Generalization of the Return Probability in the Algorithmic Relativistic Checkerboard Model	Peter Johnson Colorings of Graphs with reference to other Graphs
4:20-4:40	Francisco Rios On Substructural Logics for Quantum Computing	Ian Gossett Orientations and Additive Colorings of Graphs
4:45-5:05	Elaine Wong A Software Demonstration for Symbolic Computation in Combinatorics	Chong Li Flows of 3-edge Colorable Cubic Signed Graphs
5:10-5:30	Xi Chen Resonant Sets in Benzenoid Systems	Joseph Wittrok Antimagic Labelling of Subdivided Caterpillars

May 14, 2023

8:30-9:20     Plenary talk: Tomas Kaiser (West Bohemia)

                      Title: Hamiltonicity of line graphs of (hyper) graphs

                      Room: SCI 1006

Time	Room SCI 1190	Room SCI 1191
9:30-9:50	Sulin Song On Hamiltonian Properties of K1,r-Free Split Graphs	Elena Pavelescu The Complement Problems for Linkless Embeddability and Knotless Embeddability
9:55-10:15	Yikang Xie A condition on Hamilton-connected Line Graphs	Andrei Pavelescu Apex-nIL Graphs
10:15-10:30	Break
10:30-10:50	Max Alekseyev Enumeration of Payphone Permutations	Mark Ellingham A Fano Framework for Graph Embeddings
10:55-11:15	Xiaofeng Gu Extremal Results of Transversal Critical Graphs	Attila Por Orientation Preserving Map of the Grid and Projective Rigidity/Flexibility
11:15-11:30	Break

11:30-12:20   Plenary talk: Luke Postle (University of Waterloo)

                         Title: Generalizing and Localizing the Four-Color Theorem

                        Room: SCI 1006

12:30              Lunch (Box lunch provided)

End of Conference