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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20231004T153000
DTEND;TZID=UTC:20231004T163000
DTSTAMP:20260615T044339
CREATED:20230930T100717Z
LAST-MODIFIED:20230930T100717Z
UID:7351-1696433400-1696437000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Iain Beaton\, Acadia University\nTitle: On the Unimodality of Nearly-Well Dominated Trees\n\n\nAbstract: A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph G is the generating function of the number of dominating sets of each cardinality in G\, and its coefficients have been conjectured to be unimodal. In this talk we will show the domination polynomial of a tree T is unimodal so long as the sizes of the minimal dominating sets of T do not differ by too much. We will also discuss a version of this result for directed trees and its connection to the unimodality conjecture for the independence polynomial of a well-covered tree.\n\n \nZoom link:\n\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-3/
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:20231018T153000
DTEND;TZID=UTC:20231018T163000
DTSTAMP:20260615T044339
CREATED:20231012T115001Z
LAST-MODIFIED:20231012T223528Z
UID:7376-1697643000-1697646600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Two short talks by grad students Alex Clow and William Kellough. ‘Live’ viewing in Chase 227 for those at Dalhousie. \nTalk 1:\nAlex Clow\, Simon Fraser University\nPolynomially Bounding the Oriented Chromatic Number in Euler Genus \nIn this talk we consider the oriented chromatic number of graphs with bounded Euler genus. In particular\, we present our proofs that the oriented chromatic number is at most $g^{6400}$ for sufficiently large $g$ and at least $\Omega((\frac{g^2}{\log g})^{1/3})$. This is a major improvement over the previous best upper bound which is exponential in genus. We conclude the talk by discussing directions for future study. Joint work with Peter Bradshaw and Jingwei Xu from the University of Illinois at Urbana Champaign. \nTalk 2:\nWilliam Kellough\, Memorial University\nHow to Catch a Cheating Robber on Strong Products \nCops and Robbers is a pursuit-evasion game played on the vertices of a graph. One player controls a set of cops and the other player controls a robber. The cops win if a cop can move to the vertex occupied by the robber in finitely many turns\, otherwise the robber wins. In this talk\, we consider a variation of Cops and Robbers where both players move simultaneously and the robber “cheats” by knowing how the cops will move each round. We will give bounds on the minimum number of cops needed to win this game when played on the strong product of two graphs. This is joint work with Nancy Clarke and Danny Dyer. \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-4/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR