Related papers: The firefighter problem on polynomial and intermed…

In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\ldots,s_k,n).$ These formulas are…

We consider a generic family of polynomial maps $f:=(f_1,f_2):\mathbb{C}^2\rightarrow\mathbb{C}^2$ with given supports of polynomials, and degree $ d(f):=\max (deg f_1, deg f_2)$. We show that the (non-) properness of maps $f$ in this…

In this paper we study the asymptotic behavior of solutions of fractional differential equations of the form $D^{\alpha}_Cu(t)=Au(t)+f(t)$ on the half line, where $D^{\alpha}_Cu(t)$ is the derivative of the function $u$ in Caputo's sense,…

We exhibit a finitely generated group $G$ and a sequence of finite index normal subgroups $N_n\trianglelefteq G$ such that for every finite generating subset $S\subseteq G$, the sequence of finite Cayley graphs $(G/N_n, S)$ does not…

The largest order $n(d,k)$ of a graph of maximum degree $d$ and diameter $k$ cannot exceed the Moore bound, which has the form $M(d,k)=d^k - O(d^{k-1})$ for $d\to\infty$ and any fixed $k$. Known results in finite geometries on generalised…

Let $G$ be any connected graph on $n$ vertices, $n \ge 2.$ Let $k$ be any positive integer. Suppose that a fire breaks out at some vertex of $G.$ Then, in each turn firefighters can protect at most $k$ vertices of $G$ not yet on fire; Next…

This paper considers the topological degree of $G$-shifts of finite type for the case where $G$ is a nonabelian monoid. Whenever the Cayley graph of $G$ has a finite representation and the relationships among the generators of $G$ are…

A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time…

By studying the heat semigroup, we prove Li-Yau type estimates for bounded and positive solutions of the heat equation on graphs, under the assumption of the curvature-dimension inequality $CDE'(n,0)$, which can be consider as a notion of…

Let $\mathbf{k} := (k_1,\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

The firefighter problem is NP-hard and admits a $(1-1/e)$ approximation based on rounding the canonical LP. In this paper, we first show a matching integrality gap of $(1-1/e+\epsilon)$ on the canonical LP. This result relies on a powerful…

In the present paper, we develop geometric analytic techniques on Cayley graphs of finitely generated abelian groups to study the polynomial growth harmonic functions. We develop a geometric analytic proof of the classical Heilbronn theorem…

We generalise the popular cops and robbers game to multi-layer graphs, where each cop and the robber are restricted to a single layer (or set of edges). We show that initial intuition about the best way to allocate cops to layers is not…

We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in…

A class of graphs is $\chi$-bounded if there is a function $f$ such that every graph $G$ in the class has chromatic number at most $f(\omega(G))$, where $\omega(G)$ is the clique number of $G$; the class is polynomially $\chi$-bounded if…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

Sub-Gaussian heat kernel estimates are typical of fractal graphs. We show that sub-Gaussian estimates on graphs follow from a Poincar\'e inequality, capacity upper bound, and a slow volume growth condition. An important feature of this work…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial time, even if the digraph has multiple edges. We also show a…