BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.4.1//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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:America/Halifax
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20190310T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20191103T050000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20200308T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20201101T050000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20210314T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20211107T050000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20210120T153000
DTEND;TZID=UTC:20210120T163000
DTSTAMP:20210127T180143Z
CREATED:20201006T115021Z
LAST-MODIFIED:20210127T180143Z
UID:5727-1611156600-1611160200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Dr. Hugh Thomas\, UQAM
DESCRIPTION:Dynamical algebraic combinatorics and independence sets of graphs\nDynamical algebraic combinatorics is a relatively new (and fun!) topic\, which looks at cyclic group actions on objects from algebraic combinatorics\, inspired by some questions coming from dynamical systems. I will give an introduction to the area\, focusing on an action I have defined with Nathan Williams on the independent sets of a graph (arXiv:1805.00815). We also construct a partial order on the set of independent sets of a graph\, which may be of independent interest. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2021-01-20/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20210113T153000
DTEND;TZID=UTC:20210113T163000
DTSTAMP:20210127T175821Z
CREATED:20201006T115021Z
LAST-MODIFIED:20210127T175821Z
UID:5724-1610551800-1610555400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Dr Stephen Finbow\, Saint Francis Xavier University
DESCRIPTION:The γ-graph of a graph\nFor a graph G = (V\, E)\, the γ-graph of G\, G(γ) = (V (γ)\, E(γ))\, is the reconfiguration graph whose vertex set is the collection of minimum dominating sets\, or γ-sets of G\, and two γ-sets are adjacent in G(γ) if they differ by a single vertex and the two different vertices are adjacent in G. The γ-graph of G was introduced by Fricke et al. in 2011 where they studied properties of γ-graphs\, and raised seven questions. In this seminar we will discuss the study of γ-graphs to date with a focus on the progress of these questions. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2021-01-13/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201209T153000
DTEND;TZID=UTC:20201209T163000
DTSTAMP:20201231T210934Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201231T210934Z
UID:5694-1607527800-1607531400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Dr Erin Meger (Université du Québec à Montréal)
DESCRIPTION:The Iterated Local Model for Social Networks\nComplex networks are said to exhibit four key properties: large scale\, evolving over time\, small world properties\, and power law degree distribution. The Preferential Attachment Model (Barab´asi–Albert\, 1999) and the ACL Preferential Attachment Model (Aiello\, Chung\, Lu\, 2001) for random networks\, evolve over time and rely on the structure of the graph at the previous time step. Further models of complex networks include: the Iterated Local Transitivity Model (Bonato\, Hadi\, Horn\, Pralat\, Wang\, 2011) and the Iterated Local Anti-Transitivity Model (Bonato\, Infeld\, Pokhrel\, Pralat\, 2017). In this talk\, we will define and discuss the Iterated Local Model. This is a generalization of the ILT and ILAT models\, where at each time step edges are added deterministically according to the structure of the graph at the previous time step. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-12-09/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201202T153000
DTEND;TZID=UTC:20201202T163000
DTSTAMP:20201231T204813Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201231T204813Z
UID:5691-1606923000-1606926600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Dr Melissa Huggan (Ryerson University)
DESCRIPTION:The Cheating Robot and Insider Information\nThroughout this talk\, we explore a deterministic model as an alternative approach to studying simultaneous play combinatorial games. We call this the Cheating Robot model. This model forces both players to move at the same time\, but one player has extra information about where their opponent is going to move and can react accordingly. We discuss some general theory and explore a case study to get some insight into this model. This is joint work with Richard J. Nowakowski. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-12-02/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201125T153000
DTEND;TZID=UTC:20201125T163000
DTSTAMP:20201231T162125Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201231T162125Z
UID:5664-1606318200-1606321800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Dr Jared Howell (Memorial University of Newfoundland\, Grenfell Campus)
DESCRIPTION:Gracefully labelling windmills using Skolem-like sequences\nTo gracefully label a graph G\, assign each vertex v ∊ V(G) a distinct label l(v) from {0\,1\,2\,…\,|E(G)|}\, such that {|l(u)-l(v)| : uv ∊ E(G)}={1\,2\,3\,…\,|E(G)|}. In this talk we will examine constructive techniques using Skolem-like sequences to gracefully label windmills of cycles. This includes new constructive techniques for known results as well as new results on windmills with vanes of mixed cycle length. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-11-25/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201118T153000
DTEND;TZID=UTC:20201118T163000
DTSTAMP:20201108T230211Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201108T230211Z
UID:5573-1605713400-1605717000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Kyle MacKeigan (PhD Candidate\, Dalhousie University)
DESCRIPTION:Orthogonal Colourings of Graphs\nTwo colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring\, then those vertices receive distinct colours in the other colouring. In this talk\, the importance of perfect orthogonal colourings is demonstrated. Then\, perfect orthogonal colourings of Cayley graphs and tree graphs are constructed. To conclude\, it is shown how the Cartesian\, tensor\, and strong graph product can be used to generate perfect orthogonal colourings. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-11-18/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201104T153000
DTEND;TZID=UTC:20201104T163000
DTSTAMP:20201108T225743Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201108T225743Z
UID:5569-1604503800-1604507400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar:  Dr Andrea Burgess (University of New Brunswick\, Saint John)
DESCRIPTION:Equitably colourable cycle decompositions\n A -colouring of a decomposition of a graph  is an assignment of  colours to the vertices of . A colouring is equitable if each colour is represented (as closely as possible) an equal number of times on each block\, i.e. for any two colours  and \, the number of vertices of colour  and  in any given block differ by at most 1. In this talk\, we give an overview of colourings of designs and cycle decompositions\, and present some recent joint results with Francesca Merola on the existence of equitably 2-colourable cycle decompositions of the cocktail party graph. In particular\, we give a complete existence result for equitably 2-colourable -cycle decompositions of  in various cases\, including that  or  (mod );  is a power of 2;  for  a prime power; or . \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-11-04/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201028T153000
DTEND;TZID=UTC:20201028T163000
DTSTAMP:20201108T225542Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201108T225542Z
UID:5565-1603899000-1603902600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar:  Iain Beaton (PhD Candidate\, Dalhousie University)
DESCRIPTION:The Average Order of Dominating Sets of a Graph\nThis talk focuses on the average order of dominating sets of a graph. We find the extremal graphs for the maximum and minimum value over all graphs on n vertices\, while for trees we prove that the star minimizes the average order of dominating sets. We prove the average order of dominating sets in graphs without isolated vertices is at most 3n/4\, but provide evidence that the actual upper bound is 2n/3. Finally\, we show that the normalized average\, while dense in [1/2\,1]\, tends to 1/2 for almost all graphs. \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-10-28/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20201021T153000
DTEND;TZID=UTC:20201021T163000
DTSTAMP:20201006T115021Z
CREATED:20201006T115021Z
LAST-MODIFIED:20201006T115021Z
UID:5508-1603294200-1603297800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar:  Dr. Ben Cameron (University of Guelph)
DESCRIPTION:Title: Families of graphs containing only finitely many vertex-critical graphs. \nIn this talk\, motivated by algorithmic aspects of graph colouring\, we will consider the problem of classifying vertex-critical graphs in families of graphs. We will complete a dichotomy theorem for the number of k-vertex-critical H-free graphs when H is a graph of order four. Our results also reduce the remaining open problem for graphs of all orders to two families of graphs. Toward implementing the corresponding graph colouring algorithms\, we then improve upon previous research to show tight upper bounds on the order and independence number of k-vertex-critical graphs in another family of graphs\, allowing for exhaustive generation of these graphs for k at most 7 . Joint work with Chính Hoàng and Joe Sawada
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-dr-ben-cameron-university-of-guelph/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20201014T153000
DTEND;TZID=America/Halifax:20201014T163000
DTSTAMP:20201002T185318Z
CREATED:20200904T115630Z
LAST-MODIFIED:20201002T185318Z
UID:5488-1602689400-1602693000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: David Pike (Memorial)
DESCRIPTION:Perfect 1-Factorisations\n A matching in a graph  is a subset  of the edge set of  such that no two edges of  share a vertex. A 1-factor of a graph  is a matching  in which every vertex of  is in one of the edges of . If  is a -regular graph of even order then we can ask whether  admits a 1-factorisation\, namely a partition of its edge set into  1-factors. \nSuppose that  are the 1-factors of a 1-factorisation  of a -regular graph . If\, for each \, the union  yields a Hamilton cycle in \, then we say that  is a perfect 1-factorisation. We will discuss some of the history and properties of 1-factorisations\, including the recent discovery of a perfect 1-factorisation of . \nThe Atlantic Graph Theory Seminar series will take place every Wednesday from 3:30-4:30 ADT online via zoom. The talks\, provided by researchers\, postdocs and graduate students\, will be on a variety of current topics in graph theory. If you would like to give a talk or attend\, please email one of the organizers (Jason Brown and Danielle Cox).
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2020-10-14/
LOCATION:Zoom seminar
CATEGORIES:Atlantic Graph Theory Seminar
ORGANIZER;CN="Danielle Cox":MAILTO:danielle.cox@msvu.ca
END:VEVENT
END:VCALENDAR