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:20220406T153000
DTEND;TZID=UTC:20220406T163000
DTSTAMP:20260611T020117
CREATED:20220404T142531Z
LAST-MODIFIED:20220404T142531Z
UID:6637-1649259000-1649262600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: John Engbers (Marquette University)
DESCRIPTION:Extremal questions for vertex colorings of graphs\n\nFor graphs $G$ and $H$\, an $H$-coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ so that an edge in $G$ is mapped to an edge in $H$.  The graph $H$ can be thought of as the allowable coloring scheme: its vertices are the colors used and its edges indicating colors that can appear on the endpoints of an edge in $G$. When the graph $H$ is the complete graph $K_q$\, an $H$-coloring corresponds to a proper vertex coloring of $G$ with $q$ colors; when $H$ is an edge with one looped endvertex\, an $H$-coloring corresponds to an independent set in $G$.After familiarizing ourselves with the notion of an $H$-coloring\, we will consider the following extremal graph theory question: given a family of graphs and an $H$\, which graph in the family has the most number of $H$-colorings\, and which has the least number of $H$-colorings?  We will discuss some things that are known (and not known!) in a variety of families\, including trees and graphs with a fixed minimum degree.\n\n\nJoin Zoom Meeting: link\n\n\n 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-john-engbers-marquette-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:20220316T153000
DTEND;TZID=UTC:20220316T163000
DTSTAMP:20260611T020117
CREATED:20220314T110128Z
LAST-MODIFIED:20220314T110138Z
UID:6626-1647444600-1647448200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Theodore Kolokolnikov (Dalhousie)
DESCRIPTION:We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs\, we explicitly compute both their algebraic connectivity and as well as the full spectrum distribution. For an integer d in [3\,8]\, we find families of random semi-regular graphs that have higher algebraic connectivity than a random d-regular graphs with the same number of vertices and edges. On the other hand\, we show that regular graphs beat semi-regular graphs when d >8. More generally\, we study random semi-regular graphs whose average degree is d\, not necessary an integer. This provides a natural generalization of a d-regular graph in the case of a non-integer d. We characterise their algebraic connectivity in terms of a root of a certain 6th-degree polynomial. Finally\, we construct a small-world-type network of average degree 2.5 with a relatively high algebraic connectivity. We also propose some related open problems and conjectures.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-theodore-kolokolnikov-dalhousie/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20220309T153000
DTEND;TZID=UTC:20220309T163000
DTSTAMP:20260611T020117
CREATED:20220307T121100Z
LAST-MODIFIED:20220307T122041Z
UID:6619-1646839800-1646843400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Pjotr Buys (University of Amdsterdam)
DESCRIPTION:About a year ago Jason Brown spoke in our seminar (of the university of Amsterdam) about the two-terminal reliability polynomial and left us with some questions about the closure of the complex zeros of all such polynomials (the zero-locus). In this talk I will define a way to capture\, for a certain parameter\, whether the set of all two-terminal reliability polynomials behaves chaotically around this parameter or not\, i.e. whether this parameter is active or passive. I call the set of all active parameters the activity-locus and I will show that it is equal to the zero-locus. I will use this framework to prove some fun things about the zero-locus. Although I have not yet figured out how to use this to answer any of the open questions posed by Jason\, I am hopeful it might be a step in the right direction. \n\nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-pjotr-nuys-university-of-amdsterdam/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20220216T153000
DTEND;TZID=UTC:20220216T163000
DTSTAMP:20260611T020117
CREATED:20220215T113731Z
LAST-MODIFIED:20220215T113757Z
UID:6608-1645025400-1645029000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Ferenc Bencs (University of Amsterdam)
DESCRIPTION:In this talk\, I will show regions that contain no complex zeros the edge-cover polynomials of hypergraphs. The edge cover polynomial of a graph $G$ is the generating function of edges that covers $V(G)$. It is known that the zeros of this polynomial have length at most $\frac{(2+\sqrt{3})^2}{1+\sqrt{3}}$\, that we strengthen by showing that it is at most $4$.  We use the general subgraph counting polynomial of Wagner to establish this result along with its generalization for the edge cover polynomial of hypergraphs. As another example\, we will establish a new bound on the length of the zeros of the domination and total domination polynomials of graphs in terms of the maximum degree.\n\n\n\n\n\nJoint work with P\’eter Csikv\’ari and  Guus Regts.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-ferenc-bencs-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:20220209T153000
DTEND;TZID=UTC:20220209T163000
DTSTAMP:20260611T020117
CREATED:20220207T121303Z
LAST-MODIFIED:20220207T121303Z
UID:6584-1644420600-1644424200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Margaret-Ellen Messinger (Mount Allison University)
DESCRIPTION:Reconfiguration for Dominating Sets\n\nGiven a problem and a set of feasible solutions to that problem\, the associated  reconfiguration problem involves determining whether one feasible solution to the original problem can be transformed to a different feasible solution through a sequence of allowable moves\, with the condition that the intermediate stages are also feasible solutions.  Any reconfiguration problem can be modelled with a  reconfiguration graph\, where the vertices represent feasible solutions and two vertices are adjacent if and only if the corresponding feasible solutions can be transformed to each other via em one allowable move.The domination reconfiguration graph of a graph $G$\, denoted ${\mathcal D}(G)$\, has a vertex corresponding to each dominating set of $G$ and two vertices of ${\mathcal D}(G)$ are adjacent if and only if the corresponding dominating sets differ by the deletion or addition of a single vertex.  We are interested in properties of domination reconfiguration graphs. For example\, it is easy to see that they are always connected and bipartite.  We can also characterize exactly which graphs yield domination reconfiguration graphs with Eulerian circuits.  While none has a Hamilton cycle\, we explore families of graphs whose reconfiguration graphs have Hamilton paths.\n\n\nJoin Zoom Meeting: link\n\n 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-margaret-ellen-messinger-mount-allison-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:20220202T153000
DTEND;TZID=UTC:20220202T163000
DTSTAMP:20260611T020117
CREATED:20220130T142415Z
LAST-MODIFIED:20220131T120204Z
UID:6579-1643815800-1643819400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Melissa Huggan (Mount Allison)
DESCRIPTION:The Orthogonal Colouring Game\nThe Orthogonal Colouring Game is a combinatorial game in which two players alternately colour vertices of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colouring. Each player aims to maximize her score\, which is the number of coloured vertices in the copy of the graph she owns. An involution $\sigma$ of a graph $G$ is strictly matched if its fixed point set induces a clique and any non-fixed point $v \in V(G)$ is connected with its image $\sigma(v)$ by an edge. \nIn this talk\, we introduce the game and our main result that the second player has a strategy to force a draw in this game for graphs that admit a strictly matched involution. We will also give a structural characterization of graphs admitting a strictly matched involution. \nThis is joint work with Stephan Dominique Andres\, Francois Dross\, Fionn Mc Inerney\, and Richard J. Nowakowski. \nJoin Zoom Meeting: link \n 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-melissa-huggan-mount-allison/
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:20260611T020117
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
BEGIN:VEVENT
DTSTART;TZID=UTC:20220119T153000
DTEND;TZID=UTC:20220119T163000
DTSTAMP:20260611T020117
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:20220112T153000
DTEND;TZID=UTC:20220112T163000
DTSTAMP:20260611T020117
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:20211208T153000
DTEND;TZID=UTC:20211208T163000
DTSTAMP:20260611T020117
CREATED:20211206T120336Z
LAST-MODIFIED:20211206T120336Z
UID:6547-1638977400-1638981000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Sandra Kingan (Brooklyn College and Graduate Center\, CUNY)
DESCRIPTION:I will begin by giving a general overview of what it means to find monarchs for excluded minor classes of graphs and matroids. In a paper that appeared in 2018\, I used the Strong Splitter Theorem to give a short proof of Oxley’s result that the class of binary matroids with no 4-wheel minor consists of a few small matroids and an infinite family of maximal 3-connected rank r matroids known as the binary spikes. Such a family is called a monarch for the excluded minor class. This proof essentially comes down to finding the monarchs for non-regular matroids with no minors isomorphic to a 9-element rank 4 matroid known as P9 or its dual P*9. In a paper that appeared this year (Australasian Journal of Combinatorics\, 79(3)\, 302–326)\, I was able to strengthen the result by characterizing the class of binary non-regular matroids with no minor isomorphic to just P*9. The only members of this class are the rank 3 and 4 binary projective geometries\, a 16-element rank 5 matroid\, and two monarchs: the rank r binary spikes with 2r+1 elements mentioned earlier and another infinite family with 4r−5 elements. As a consequence\, a simple binary matroid of rank at least 6 with no P*9-minor has size at most r(r+1)/2 and this bound is attained by the rank r complete graph. This is one of few excluded minor classes for which the members are so precisely determined. \n  \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-sandra-kingan-brooklyn-college-and-graduate-center-cuny/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211201T153000
DTEND;TZID=UTC:20211201T163000
DTSTAMP:20260611T020117
CREATED:20211128T200242Z
LAST-MODIFIED:20211128T200242Z
UID:6543-1638372600-1638376200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: James Preen (Cape Breton University)
DESCRIPTION:There are many results about triangles in graphs\, but the property that every edge in a graph is in at least one triangle seems not to have been studied before. The 4-regular case was quickly solved collaboratively following an internet posting and then written about by one author in their blog\, before being published in the Journal of Graph Theory in 2013. \nHowever\, the result that was originally wanted was a characterisation for 5-regular graphs\, and that did not emerge as smoothly. With no solution published several years later\, I started working on it and have submiited my paper resolving it in 2021. In this talk I will outline the background and the ideas used in the proof\, which involves cliques\, multiple edges and a generalisation of the the line graph construction. \nJoin Zoom Meeting: link\nTo view previous slides and talks\, click here.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-james-preen-cape-breton-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:20211117T153000
DTEND;TZID=UTC:20211117T163000
DTSTAMP:20260611T020117
CREATED:20211115T114239Z
LAST-MODIFIED:20211115T114239Z
UID:6506-1637163000-1637166600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Pavol Hell (SFU)
DESCRIPTION:I will discuss a few examples where considering loops leads to interesting insights\, often allowing unifying existing results. These examples will include cops and robbers games\, graph homomorphisms\, variants of interval and chordal graphs\,\nand versions of domination. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-pavol-hell-sfu/
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:20211103T153000
DTEND;TZID=UTC:20211103T163000
DTSTAMP:20260611T020117
CREATED:20211031T172611Z
LAST-MODIFIED:20211031T172611Z
UID:6472-1635953400-1635957000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Jo Ellis-Monaghan (University of Amsterdam)
DESCRIPTION:2017 saw the centennial of William Tutte\, one of the greatest mathematicians of modern times.  One of the testimonies to Tutte’s genius is that nearly everything he did proved to be a catalyst\, triggering an explosion of further investigations and opening whole new vistas of mathematics.  The Tutte polynomial is one of many such examples in his legacy.   Here we will explore some of its salient properties and some of the many directions that propagated outward from the original Tutte polynomial.  These include several ways in which the Tutte polynomial may be defined and its universality\, as well as some of its combinatorial and algebraic properties.  We will showcase information encoded in the Tutte polynomial as evaluations and specializations\, as these inform nearly every aspect of combinatorics.   Furthermore\, the scope of the Tutte polynomial is continually broadening through generalizations of either its domain or parameter space\, and we will highlight some important examples\, and touch on its interrelations with other combinatorial polynomials.  We will conclude with its particularly fruitful connections with biology and the Potts model of statistical mechanics\, and offer some open questions.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jo-ellis-monaghan-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:20260611T020117
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
BEGIN:VEVENT
DTSTART;TZID=UTC:20211020T153000
DTEND;TZID=UTC:20211020T163000
DTSTAMP:20260611T020117
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:20211013T153000
DTEND;TZID=UTC:20211013T163000
DTSTAMP:20260611T020117
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:20211006T153000
DTEND;TZID=UTC:20211006T163000
DTSTAMP:20260611T020117
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
END:VCALENDAR