BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.4.1//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:America/Halifax
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20190310T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20191103T050000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20200308T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20201101T050000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20210314T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20211107T050000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20201014T153000
DTEND;TZID=America/Halifax:20201014T163000
DTSTAMP:20201002T185318Z
CREATED:20200904T115630Z
LAST-MODIFIED:20201002T185318Z
UID:5488-1602689400-1602693000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: David Pike (Memorial)
DESCRIPTION:Perfect 1-Factorisations\n A matching in a graph  is a subset  of the edge set of  such that no two edges of  share a vertex. A 1-factor of a graph  is a matching  in which every vertex of  is in one of the edges of . If  is a -regular graph of even order then we can ask whether  admits a 1-factorisation\, namely a partition of its edge set into  1-factors. \nSuppose that  are the 1-factors of a 1-factorisation  of a -regular graph . If\, for each \, the union  yields a Hamilton cycle in \, then we say that  is a perfect 1-factorisation. We will discuss some of the history and properties of 1-factorisations\, including the recent discovery of a perfect 1-factorisation of . \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-10-14/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Danielle Cox":MAILTO:danielle.cox@msvu.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201021T153000
DTEND;TZID=UTC:20201021T163000
DTSTAMP:20201006T115021Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201006T115021Z
UID:5508-1603294200-1603297800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar:  Dr. Ben Cameron (University of Guelph)
DESCRIPTION:Title: Families of graphs containing only finitely many vertex-critical graphs. \nIn this talk\, motivated by algorithmic aspects of graph colouring\, we will consider the problem of classifying vertex-critical graphs in families of graphs. We will complete a dichotomy theorem for the number of k-vertex-critical H-free graphs when H is a graph of order four. Our results also reduce the remaining open problem for graphs of all orders to two families of graphs. Toward implementing the corresponding graph colouring algorithms\, we then improve upon previous research to show tight upper bounds on the order and independence number of k-vertex-critical graphs in another family of graphs\, allowing for exhaustive generation of these graphs for k at most 7 . Joint work with Chính Hoàng and Joe Sawada
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-dr-ben-cameron-university-of-guelph/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201028T153000
DTEND;TZID=UTC:20201028T163000
DTSTAMP:20201108T225542Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201108T225542Z
UID:5565-1603899000-1603902600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar:  Iain Beaton (PhD Candidate\, Dalhousie University)
DESCRIPTION:The Average Order of Dominating Sets of a Graph\nThis talk focuses on the average order of dominating sets of a graph. We find the extremal graphs for the maximum and minimum value over all graphs on n vertices\, while for trees we prove that the star minimizes the average order of dominating sets. We prove the average order of dominating sets in graphs without isolated vertices is at most 3n/4\, but provide evidence that the actual upper bound is 2n/3. Finally\, we show that the normalized average\, while dense in [1/2\,1]\, tends to 1/2 for almost all graphs. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-10-28/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
END:VCALENDAR