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:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20211006T153000
DTEND;TZID=UTC:20211006T163000
DTSTAMP:20260616T151839
CREATED:20211004T174543Z
LAST-MODIFIED:20211004T174543Z
UID:6322-1633534200-1633537800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Anthony Bonato (Ryerson University)
DESCRIPTION:In pursuit-evasion games\, a set of pursuers attempts to locate\, eliminate\, or contain an evader in a network. The rules\, specified from the outset\, greatly determine the difficulty of the questions posed above. For example\, the evader may be visible\, but the pursuers may have limited movement speed\, only moving to nearby vertices adjacent to them. \nCentral to pursuit-evasion games is the idea of optimizing certain parameters\, whether they are the search number\, burning number\, or localization number\, for example. We report on progress in several pursuit-evasion games on graphs and conjectures arising from their analysis. Finding the values\, bounds\, and algorithms to compute these graph parameters leads to topics intersecting graph theory\, the probabilistic method\, and geometry.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-anthony-bonato-ryerson-university/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211013T153000
DTEND;TZID=UTC:20211013T163000
DTSTAMP:20260616T151839
CREATED:20211012T120433Z
LAST-MODIFIED:20211012T120607Z
UID:6327-1634139000-1634142600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Danny Dyer (Memorial University)
DESCRIPTION:Title: The basics of the deduction game \nAbstract: \nThe deduction game is a new variant of the classical chasers and runners game where the chasers are trying to catch an invisible runner quickly\, but with no communication possible between chasers on different vertices. Instead\, chasers may deduce where their fellow chasers *must* move\, and make corresponding adjustments to their own movements. The goal is to use as few chasers as possible\, and in some cases that number is quite high. We will examine some bounds on the deduction number\, determine the deduction number of several classes of graphs\, and pose some open problems. This is joint work with Andrea Burgess and Mozhgan Farahani. \nJoin Zoom Meeting 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-danny-dyer-memorial-university/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211020T153000
DTEND;TZID=UTC:20211020T163000
DTSTAMP:20260616T151839
CREATED:20211025T003426Z
LAST-MODIFIED:20211025T003520Z
UID:6454-1634743800-1634747400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Viresh Patel (University of Amsterdam)
DESCRIPTION:Title: Path decompositions of random directed graphs \nIn this talk we consider the problem of partitioning the edges of a digraph into as few paths as possible. The minimum number of paths needed in such an edge decomposition is called the path number of the digraph. \nThe problem of determining the path number is generally NP-hard. However\, there is a simple (easy to compute) lower bound for the path number of a digraph in terms of its degree sequence\, and a conjecture of Alspach\, Pullman\, and Mason from 1976 states that this lower bound gives the correct value of the path number for any even tournament. The conjecture was recently resolved\, and in this talk I will discuss to what extent the conjecture holds for other digraphs. In particular I will discuss some of the ingredients of a recent result showing that the conjecture holds for almost all digraphs. \nMore generally we will see the conjecture holds with high probability for the random directed graph D_{n\,p} for a large range of p. In fact the proof does not use randomness in a significant way.\n\nThis is joint work with Alberto Espuny Díaz and Fabian Stroh. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-viresh-patel-university-of-amsterdam/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211027T153000
DTEND;TZID=UTC:20211027T163000
DTSTAMP:20260616T151839
CREATED:20211025T002720Z
LAST-MODIFIED:20211025T003603Z
UID:6450-1635348600-1635352200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Guss Regts (University of Amsterdam)
DESCRIPTION:Improved bounds for zeros of the chromatic polynomial on bounded degree graphs\nAbout 20 years ago Sokal proved that there exists a constant C so that for any graph G\, all of the complex zeros of its chromatic polynomial are contained in the disk of radius C Delta(G) centered at 0. (Here Delta(G) denotes the maximum degree of G.) He showed that C could be taken slightly smaller than 8. This was improved to 6.91 by Fernández and Procacci. In this talk I will present an improvement to 5.02 and explain some of the ideas and ingredients of the proof. \nBased on joint work with Maurizio Moreschi\, Viresh Patel and Ayla Stam. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
END:VCALENDAR