BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20260204T153000
DTEND;TZID=UTC:20260204T163000
DTSTAMP:20260610T183419
CREATED:20260130T184215Z
LAST-MODIFIED:20260130T184215Z
UID:8497-1770219000-1770222600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Jorik Jooken - Feb 4
DESCRIPTION:Speaker: Jorik Jooken\, KU Leuven Kulak\nTitle: On vertex-girth-regular graphs: (Non-)existence\, bounds and enumeration\n\nAbstract: A vertex-girth-regular vgr(v\,k\,g\,lambda)-graph is a k-regular graph of girth g and order v in which every vertex belongs to exactly lambda cycles of length g. While all vertex-transitive graphs are necessarily vertex-girth-regular\, the majority of vertex-girth-regular graphs are not vertex-transitive. Similarly\, while many of the smallest k-regular graphs of girth g\, the so-called (k\,g)-cages\, are vertex-girth-regular\, infinitely many vertex-girth-regular graphs of degree k and girth g exist for many pairs k\, g. Due to these connections\, the study of vertex-girth-regular graphs promises insights into the relations between the classes of extremal\, highly symmetric\, and locally regular graphs of given degree and girth. This paper lays the foundation to such study by investigating the fundamental properties of vgr(v\,k\,g\,lambda)-graphs\, specifically the relations necessarily satisfied by the parameters  and to admit the existence of a corresponding vertex-girth-regular graph\, by presenting constructions of infinite families of vgr(v\,k\,g\,lambda)-graphs\, and by establishing lower bounds on the number v of vertices in a vgr(v\,k\,g\,lambda)-graph. It also includes computational results determining the orders of smallest cubic and quartic graphs of small girths.\nFull paper: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i4p51\n\nZoom link:\nhttps://us02web.zoom.us/j/88013261876?pwd=XGocyHqvseXY8metPztPoSuulEEejX.1\n\nMeeting ID: 880 1326 1876\nPasscode: 357963
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jorik-jooken-feb-4/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20260211T153000
DTEND;TZID=UTC:20260211T163000
DTSTAMP:20260610T183419
CREATED:20260207T121840Z
LAST-MODIFIED:20260207T121840Z
UID:8545-1770823800-1770827400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Date and Time: Wednesday\, February 11\, 3.40 pm Atlantic time\nSpeaker: JD Nir\, Oakland University\nTitle: The Second Common Neighbourhood Conjecture\n\nAbstract: The Second Common Neighbourhood Conjecture is a question about the structure of shared neighbours in a graph. At first glance\, it seems like a nice problem for a new researcher to study: it requires only a basic understanding of graph theory to state\, examples are easy to understand\, and one can quickly prove the conjecture holds in certain cases. However\, the full conjecture remains stubbornly unsolved. If true\, the conjecture immediately improves the best known bound in a problem in enumerative graph theory. We will introduce the conjecture\, look at some of the cases where it is known to hold\, and explore the related enumeration question.\n\nZoom link:\nhttps://us02web.zoom.us/j/88013261876?pwd=XGocyHqvseXY8metPztPoSuulEEejX.1\n\nMeeting ID: 880 1326 1876\nPasscode: 357963
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-37/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20260225T153000
DTEND;TZID=UTC:20260225T163000
DTSTAMP:20260610T183419
CREATED:20260220T115533Z
LAST-MODIFIED:20260220T115606Z
UID:8556-1772033400-1772037000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Date and Time: Wednesday\, February 25\, 3.40 pm Atlantic time\nSpeaker: Erin Meger\, Queens University\nTitle: Decomposing Forbidden Minors for Pursuit-Evasion\n\n\nAbstract: In this talk\, we consider the pursuit-evasion game Cops and Robbers. The game is played on a graph between two players: a set of cops and a single robber\, who take turns moving along the edges. The cop number of a graph is the minimum number of cops needed to guarantee capture of the robber\, meaning they eventually occupy the same vertex. It is standard to consider classes of graphs defined by forbidden substructures such as minors or induced subgraphs. A graph G is H-free or H-minor free if G does not contain\, respectively\, any induced subgraph or minor which is isomorphic to H.\n\n\nThe role of forbidden minors in pursuit-evasion began in Andrae’s work in 1986. For graphs that exclude a fixed minor H\, the upper bound for the cop-number is nearly the number of edges in this forbidden minor. When the minor has restricted structure\, we can reduce this upper bound. In this talk\, I focus on the cop-strategy to build a copy of the minor that is forbidden\, and show how we can guarantee capture due to this underlying structure. \n\n\nZoom link:\nhttps://us02web.zoom.us/j/88013261876?pwd=XGocyHqvseXY8metPztPoSuulEEejX.1\n\n\nMeeting ID: 880 1326 1876\nPasscode: 357963
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-38/
LOCATION:Online via Zoom
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR