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:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20220112T153000
DTEND;TZID=UTC:20220112T163000
DTSTAMP:20260613T170952
CREATED:20220109T183647Z
LAST-MODIFIED:20220109T183647Z
UID:6550-1642001400-1642005000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Iain Moffat (Royal Holloway\, University of London)
DESCRIPTION:Spanning Trees and Graphs Embedded in Surfaces\n\nTo what extent is a graph determined by the trees contained in it? That is\, if we know the edge sets of each of the spanning trees (i.e.\, maximal acyclic subgraphs) in a connected graph\, then do we know the graph itself? It only takes a little bit of thought to see that the answer is “no” (e.g.\, suppose the graph is a tree).  But this “no” is really a “more or less\, yes”.   A classical result of Whitney states that we know the graph up to some simple moves. \n\nIn this talk we consider what changes if we ask this question not for graphs in the abstract\, but graphs that are embedded on surfaces.  We shall see how this question brings together a seemingly disjoint collection of topics in mathematics and brings new approaches to topological graph theory.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-iain-moffat-royal-holloway-university-of-london/
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:20220119T153000
DTEND;TZID=UTC:20220119T163000
DTSTAMP:20260613T170952
CREATED:20220116T181412Z
LAST-MODIFIED:20220116T181412Z
UID:6553-1642606200-1642609800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Robert Kooij (Delft University of Technology)
DESCRIPTION:Robustness of Complex Networks \nNetwork Science aims to understand the graph structure of networks and the dynamic processes that take place on networks. Examples of processes on networks are transport of items (IP packets with digitalized  information\, cars\, containers) and diffusion (epidemics\, electric current\, water flows\, human emotions). The Network Architectures and Services Section at the Delft University of Technology contributes to the fundaments of Network Science: we investigate amongst others geometric representations of networks\, epidemic spread on networks\, spectra of  graphs and network algorithms. In addition\, we apply our mathematical knowledge to the design\, management and control of critical  infrastructures\, such as telecom networks and power grids\, in order to make these networks robust\, resilient\, efficient and reliable. In this talk we will give three examples of our results in the field of robustness of complex  networks\, namely robustness with respect to malware spread\, robustness of network controllability and the robustness of a real-world critical infrastructure. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-robert-kooij-delft-university-of-technology/
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:20220126T153000
DTEND;TZID=UTC:20220126T163000
DTSTAMP:20260613T170952
CREATED:20220124T120023Z
LAST-MODIFIED:20220124T120023Z
UID:6576-1643211000-1643214600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Andrea Burgess (UNB)
DESCRIPTION:Mutually Orthogonal Cycle Systems\nA $k$-cycle system of order $n$ is a set of $k$-cycles whose edges partition the edge set of $K_n$.  We say that two cycle systems $\mathcal{C}$ and $\mathcal{C}’$ are {\em orthogonal} if every cycle in $\mathcal{C}$ shares at most one edge with each cycle in $\mathcal{C}’$.  Orthogonal cycle systems arise naturally from simple Heffter arrays and biembeddings of cycle decompositions. \nA collection of cycle systems is {\em mutually orthogonal} if any two of the systems are orthogonal.  In this talk\, we give bounds on the number of mutually orthogonal $k$-cycle systems of order $n$ and provide constructions for sets of mutually orthogonal cyclic cycle systems. \nThis is joint work with Nicholas Cavenagh and David Pike. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-andrea-burgess-unb/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
END:VCALENDAR