相关论文: Sparse graphs are not flammable

One of the most elementary spreading models on graphs can be described by a fire spreading from a burning vertex in discrete time steps. At each step, all neighbors of burning vertices catch fire. A well-studied extension to model fire…

In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a player chooses which vertices to protect in order to contain it. In this paper, we focus on the case of trees and we consider as well the…

The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as a burning source, while fire simultaneously spreads from…

Unit disk graphs are the set of graphs which represent the intersection of disk graphs and interval graphs. These graphs are of great importance due to their structural similarity with wireless communication networks. Firefighter problem on…

Given a directed graph $G = (V, E)$ with $n$ vertices, $m$ edges and a designated source vertex $s\in V$, we consider the question of finding a sparse subgraph $H$ of $G$ that preserves the flow from $s$ up to a given threshold $\lambda$…

Graph burning is a graph process that models the spread of social contagion. Initially, all the vertices of a graph $G$ are unburnt. At each step, an unburnt vertex is put on fire and the fire from burnt vertices of the previous step…

Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of the graph. The spread of social influence, an alarm, or a…

We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either inflammable, fireproof, or burt. Every inflammable edge is replaced by a fireproof edge at unit rate, while fires start at…

Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…

The burning number $b(G)$ of a graph $G$ is the smallest number of turns required to burn all vertices of a graph if at every turn a new fire is started and existing fires spread to all adjacent vertices. The Burning Number Conjecture of…

The burning number of a graph $G$ is the smallest number $b$ such that the vertices of $G$ can be covered by balls of radii $0, 1, \dots, b-1$. As computing the burning number of a graph is known to be NP-hard, even on trees, it is natural…

Graph burning is a simple model for the spread of social influence in networks. The objective is to measure how quickly a fire (e.g., a piece of fake news) can be spread in a network. The burning process takes place in discrete rounds. In…

We prove that any Cayley graph $G$ with degree $d$ polynomial growth does not satisfy $\{f(n)\}$-containment for any $f=o(n^{d-2})$. This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that…

It is known that the online firefighting is 2-competitive on trees (Coupechoux et al. 2019), which suggests that the problem is relatively easy on trees. We extend the study to graphs containing cycles. We first show that the presence of…

The Burning Number Conjecture, that a graph on $n$ vertices can be burned in at most $\lceil \sqrt{n} \ \rceil$ rounds, has been of central interest for the past several years. Much of the literature toward its resolution focuses on two…

Let $G$ be a connected graph of order $n$, $F_k$ be a fan consisting of $k$ triangles sharing a common vertex, and $tF_k$ be $t$ vertex-disjoint copies of $F_k$. Brennan (2017) showed the Ramsey number $r(G,F_k)=2n-1$ for $G$ being a…

Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the burning number conjecture, which says that every connected…

The concept of graph burning and burning number ($bn(G)$) of a graph G was introduced recently [1]. Graph burning models the spread of contagion (fire) in a graph in discrete time steps. $bn(G)$ is the minimum time needed to burn a graph…

Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…

Graph burning is one model for the spread of memes and contagion in social networks. The corresponding graph parameter is the burning number of a graph $G$, written $b(G)$, which measures the speed of the social contagion. While it is…