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:20230208T153000
DTEND;TZID=UTC:20230208T163000
DTSTAMP:20260615T162944
CREATED:20230213T124145Z
LAST-MODIFIED:20230213T124512Z
UID:7119-1675870200-1675873800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Jason Brown\, Dalhousie University
DESCRIPTION:Colourings\, Polynomials and Roots\nA lot has happened since graph colourings first arose as an applied problem in cartography – do four colours always suffice to distinguish countries when colouring a map? Along the way to the proof\, the related enumeration function to count the number of k-colourings was proposed. While the latter didn’t help much in the quest for the Four Colour Theorem\, it did lead to a fascinating branch of graph theory\, namely chromatic polynomials. While polynomials are the simplest of functions\, their properties can take you deep within mathematics. In this talk I will describe some recent result on chromatic polynomials and their offshoots\, connecting to commutative algebra as well as real and complex analysis. And on our trip\, we visit with some old friends\, including Charles Hermite\, Jacques Sturm\, and Carl Gauss. \nMeeting ID: 831 4765 9865\nPasscode: 505092
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jason-brown-dalhousie-university/
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:20230215T153000
DTEND;TZID=UTC:20230215T163000
DTSTAMP:20260615T162944
CREATED:20230213T124408Z
LAST-MODIFIED:20230213T124408Z
UID:7121-1676475000-1676478600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Jérémie Turcotte\, Université de Montréal
DESCRIPTION:Progress towards the Burning Number Conjecture\nThe burning number b(G) of a graph G is the smallest integer k such that G can be covered by k balls of radii respectively 0\,…\,k-1\, and was introduced independently by Brandenburg and Scott at Intel as a transmission problem on processors and Bonato\, Janssen and Roshanbin as a model for the spread of information in social networks. The Burning Number Conjecture claims that b(G)<=\lceil\sqrt{n}\rceil\, where n is the number of vertices of G. This bound is tight for paths. The previous best bound for this problem\, by Bastide et al.\, was b(G)<= \sqrt{\frac{4n}{3}}+1. We prove that the Burning Number Conjecture holds asymptotically\, that is b(G)<= (1+o(1))\sqrt{n}. Following a brief introduction to graph burning\, this talk will focus on the general ideas behind the proof. \nMeeting ID: 885 9352 1895\nPasscode: 522241
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jeremie-turcotte-universite-de-montreal/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR