- Series
- Graph Theory Seminar
- Time
- Tuesday, February 22, 2022 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- Zoom
- Speaker
- Anthony Bonato – Ryerson University – abonato@ryerson.ca – https://math.ryerson.ca/~abonato/
- Organizer
- Anton Bernshteyn
Graph burning is a simplified model for the spread of influence in a network. Associated with the process is the burning number, which quantifies the speed at which the influence spreads to every vertex. The Burning Number Conjecture claims that for every connected graph G of order n, its burning number satisfies b(G)≤⌈√n⌉. While the conjecture remains open, we prove the best-known bound on the burning number of a connected graph G of order n, given by b(G)≤√4n/3+1, improving on the previously known √3n/2+O(1) bound.