Lunch Lecture Mathematics
The LunCH lecture will be given by Yuki Murakami about his research in graph theory!
Graph burning is a discrete time process which can be used to model the spread of social contagion, diseases, and influence. One is initially given a graph of unburned vertices. At each round (time step), one vertex is selected as a source to be burned; unburned vertices with at least one burned neighbour from the previous round also becomes burned. The burning number of a graph is the fewest number of rounds required to burn the graph. It has been conjectured that for a graph on n vertices, the burning number is at most the ceiling of the square root of n.
If you are interested in graph theory and discrete mathematics, this is your change to learn about what the latest research looks like and ask questions about it!
Register now