BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20230315T153000
DTEND;TZID=UTC:20230315T163000
DTSTAMP:20260609T062508
CREATED:20230315T123936Z
LAST-MODIFIED:20230315T123936Z
UID:7144-1678894200-1678897800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Caleb Jones and Rylo Ashmore (Memorial University)
DESCRIPTION:Speaker 1: Caleb Jones\, Memorial University\n \nTitle: Extending Graph Burning to Hypergraphs\n \nAbstract:\nWe introduce a round-based model much like graph burning which applies to hypergraphs. The rules for this new model are very natural\,and generalize the original model of graph burning. We also introduce a variant called lazy hypergraph burning\, along with a new parameter\, the lazy burning number. Interestingly\, lazily burning a graph is trivial\, while lazily burning a hypergraph can be quite complicated. Moreover\, the lazy burning model is a useful tool for analyzing the round-based model on hypergraphs. We obtain bounds on the burning number and lazy burning number of a hypergraph in terms of its parameters.\n \n \nSpeaker 2: Rylo Ashmore\, Memorial University\n \nTitle: Herding Cats Stuck in Trees.\n \nAbstract:\nIn the game of Cat Herding on a graph\, one player (the herder) will omnipresently delete edges\, while the other player (the cat) is on a vertex of the graph\, and will move along any path to a new vertex. Eventually\, the cat is isolated on a single vertex\, and the cat’s objective is to delay this event\, while the herder tries to hasten it. In an optimally played game\, the number of cuts the herder made to isolate the cat is the cat number of the graph. In this talk\, we will investigate this graph parameter for both dense and sparse graphs. We will see an argument that the asymptotic behaviour of the cat number of complete graphs is n^2/3. We also look at an unexpected connection between cat herding on trees and Fibonacci numbers. In particular\, we will see that trees with maximum cat number amongst graphs with n vertices have cat number asymptotically log_φ (n).\n\nZoom link: https://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09 \n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-caleb-jones-and-rylo-ashmore-memorial-university/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette%20Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR