Improved pyrotechnics : Closer to the burning graph conjecture

10/20/2021
by   Paul Bastide, et al.
0

Can every connected graph burn in ⌈√(n)⌉ steps? While this conjecture remains open, we prove that it is asymptotically true when the graph is much larger than its growth, which is the maximal distance of a vertex to a well-chosen path in the graph. In fact, we prove that the conjecture for graphs of bounded growth boils down to a finite number of cases. Through an improved (but still weaker) bound for all trees, we argue that the conjecture almost holds for all graphs with minimum degree at least 3 and holds for all large enough graphs with minimum degree at least 4. The previous best lower bound was 23.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2020

On the cop number of graphs of high girth

We establish a lower bound for the cop number of graphs of high girth in...
research
06/02/2023

New bounds for odd colourings of graphs

Given a graph G, a vertex-colouring σ of G, and a subset X⊆ V(G), a colo...
research
08/12/2020

Lower-bounds on the growth of power-free languages over large alphabets

We study the growth rate of some power-free languages. For any integer k...
research
11/26/2021

Determining triangulations and quadrangulations by boundary distances

We show that if a disc triangulation has all internal vertex degrees at ...
research
03/19/2023

Extending a triangulation from the 2-sphere to the 3-ball

Define the tet-volume of a triangulation of the 2-sphere to be the minim...
research
07/15/2020

An improved procedure for colouring graphs of bounded local density

We develop an improved bound for the chromatic number of graphs of maxim...
research
11/03/2017

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

We show that the counting class LWPP [FFK94] remains unchanged even if o...

Please sign up or login with your details

Forgot password? Click here to reset