Speaker: Mahsa N. Shirazi (UManitoba)
Title: On weakly Hadamard diagonalizable graphs
Time: 11:30 am
Room: 527 Buller building
Zoom link: https://umanitoba.zoom.us/j/66343288658 password is the first six Fibonacci numbers, starting with 11...
Speaker: JD Nir (Toronto Met)
Title: On the Best Way to Play with Fire: an Adversarial Burning Game
Time: 11:30 am
Room: 527 Buller building
Zoom link: https://umanitoba.zoom.us/j/66343288658 password is the first six Fibonacci numbers, starting with 11...
Abstract:
Graph burning is a discrete-time process that models the spread of influence in a network. Vertices are in one of two states: either burning or unburned. In each round, a burning vertex causes all of its neighbours to become burning and then a previously unburned vertex is chosen whose state is changed to burning. Previous work has focused on bounding the number of turns necessary to burn an n-vertex graph. We introduce a variation of the graph burning process that incorporates an adversarial game played on a nested, growing sequence of trees. Two players, Arsonist and Builder, play in turns: Builder adds unburned vertices to create a larger tree, then burning vertices spread fire to their neighbours, and finally Arsonist `lights' a new fire on an unburned vertex. This process repeats forever. Arsonist is said to win if the limiting fraction of burned vertices tends to 1, while the Builder is said to win if this fraction is bounded away from 1. We consider how the number of vertices granted to Builder each turn affects the optimal strategies for each player.
Speaker: Shonda Dueck (UWinnipeg)
Title: The threshold strong dimension of a graph
Time: 11:30 am
Room: 527 Buller building
Zoom link: https://umanitoba.zoom.us/j/66343288658 password is the first six Fibonacci numbers, starting with 11...
Speaker: Anita Pasotti (University of Brescia, Italy)
Title: Some conjectures on graphs with prescribed edge-lengths
Time: 11:30 am
Room: 527 Buller building
Zoom link: https://umanitoba.zoom.us/j/66343288658 password is the first six Fibonacci numbers, starting with 11...
Speaker: Tommaso Traetta (University of Brescia)
Title: Old and new problems in graph decompositions
Time 11:30 am
Room: 527 Buller building
Zoom link: https://umanitoba.zoom.us/j/66343288658 password is the first six Fibonacci numbers, starting with 11...