Events Search and Views Navigation
November 2023
Atlantic Graph Theory Seminar
Detecting (Di)Graphical Regular Representations Speaker: Joy Morris, U. Lethbridge Abstract: Graphical and Digraphical Regular Representations (GRRs and DRRs) are a concrete way to visualise the regular action of a group, using (di)graphs. More precisely, a GRR or DRR on the group $G$ is a (di)graph whose automorphism group is isomorphic to the regular action of $G$ on itself by right-multiplication. For a (di)graph to be a DRR or GRR on $G$, it must be a Cayley (di)graph on $G$. Whenever…
Find out more »Atlantic Graph Theory Seminar
Speaker: Santiago Guzman-Pro, TU Dresden Title: Forbidden Tournaments and the Orientation (Completion) Problem Abstract: For a fixed finite set of oriented graphs F, the F-free orientation problem asks whether a given finite undirected graph G has an F-free orientation, i.e., whether the edges of G can be oriented so that the resulting oriented graph does not contain any oriented graph from F as an oriented (induced) subgraph. It was first noted by Bang-Jensen, Huang, and Prisner that when F…
Find out more »University of New Brunswick Data Challenge 2023
The UNB Data Challenge 2023 will bring together two competitive tracks, Data Visualization (8th Annual), and Data Analytics (4th Annual) on Nov. 24, 2023, in a virtual format! Take up the challenge and demonstrate the power of data. Participants and teams will have the chance to showcase their ability to tell a story driven by data in unique competitive formats. Teams can participate in both tracks. It is an ideal setting for citizens to get engaged, meet leaders in academia,…
Find out more »Atlantic Graph Theory Seminar
Speaker: Jordan Barrett, Toronto Metropolitan University Title: Graph burning, the burning number conjecture, and burning density Abstract: Graph burning is a discrete time process on a graph that acts as a simple model for the spread of social contagion in a network. Graph burning was introduced by Bonato, Janssen and Roshanbin in 2014, and with this introduction came the now famous "burning number conjecture". In the first half of my talk, I will introduce graph burning and give a brief overview of…
Find out more »December 2023
Session on Combinatorial Design Theory at the 2023 Winter Meeting of the Canadian Mathematical Society
Combinatorial design theory has a history dating back to the 18th century when Leonhard Euler pondered the existence of orthogonal pairs of Latin squares. This session will showcase recent results in topics such as classical designs, cycle systems, graph decompositions, Latin squares and other aspects of design theory.
Find out more »Advances in Statistical Modeling of Fisheries Data – Seminar
A Spatiotemporal Model of Condition to Derive a Novel Starvation Mortality Index That Improves a State-space Stock Assessment Model for Atlantic Cod on the Southern Grand Bank of Newfoundland Madhura Weerasekera, Centre for Fisheries Ecosystems Research (CFER), Fisheries and Marine Institute of Memorial University of Newfoundland The Atlantic cod stock on the Southern Grand Bank (SGB) of Newfoundland collapsed in the early 1990's coincident with the collapse of cod stocks across Canadian waters. Consequently, a fishing moratorium has been in place…
Find out more »January 2024
Atlantic Graph Theory Seminar
Speaker: Leslie Hogben, Iowa State University Title: Forts, (fractional) zero forcing, and Cartesian products of graphs Abstract: Zero forcing is an iterative process that repeatedly applies a rule to change the color of vertices of a graph $G$ from white to blue. The zero forcing number is the minimum number of initially blue vertices that are needed to color all vertices blue through this process. Standard zero forcing was introduced about fifteen years ago in the control of…
Find out more »Atlantic Graph Theory Seminar
Speaker: Torsten Mütze, Un. Warwick Title: Kneser graphs are Hamiltonian Abstract: For integers k>=1 and n>=2k+1, the Kneser graph K(n,k) has as vertices all k-element subsets of an n-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle, with one notable exception, namely the Petersen graph K(5,2). This problem received considerable attention in the literature, including a recent solution for the sparsest case…
Find out more »Combinatorial Algebra Meets Algebraic Combinatorics
Combinatorial Algebra Meets Algebraic Combinatorics (CAAC) is a two-day workshop bringing together researchers working at the intersection of combinatorics and algebra. It examines the role of combinatorial structures, such as permutations, matroids and polytopes, arising from problems in Schubert calculus, commutative algebra, and other branches of algebra, representation theory and geometry.
Find out more »Atlantic Graph Theory Seminar
Speaker: Thiago de Holleben, Dalhousie University Title: Homological invariants of graphs with no induced cycles of length divisible by 3 Abstract: If G is a graph with large chromatic number, what can we say about its induced subgraphs? In 2014, Bonamy et al. showed that if a graph has no induced cycles of length divisible by three, then its chromatic number is bounded. Such graphs are called ternary. In an attempt to better understand the structure of the induced subgraphs…
Find out more »