Related papers: Sharp Davies-Gaffney-Grigor'yan Lemma on Graphs

During the last years, several algorithmic meta-theorems have appeared (Bodlaender et al. [FOCS 2009], Fomin et al. [SODA 2010], Kim et al. [ICALP 2013]) guaranteeing the existence of linear kernels on sparse graphs for problems satisfying…

Let $G=(V,E)$ be a connected finite graph. We study the relativistic non-Abelian Chern-Simons-Higgs vortex equations on the graph $G$. We establish an existence result to the relativistic non-Abelian Chern-Simons-Higgs vortex equations.

The heat kernel in the setting of classical Fourier-Bessel expansions is defined by an oscillatory series which cannot be computed explicitly. We prove qualitatively sharp estimates of this kernel. Our method relies on establishing a…

Under some mild assumptions on the Levy measure and the symbol we obtain gradient estimates of Dirichlet heat kernels for pure-jump isotropic unimodal Levy processes in $R^d$.

In this paper we prove that the \textsc{Min-Bisection} problem is NP-hard on \emph{unit disk graphs}, thus solving a longstanding open question.

We prove a Li-Yau gradient estimate for positive solutions to the heat equation defined on a metric star graph $\mG$ given by the heat kernel formula. As consequence, we derive a Harnack estimate and a Liouville property for bounded…

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvo\v{r}\'ak and Postle. We introduce and study $(i,j)$-defective DP-colorings of simple graphs. Let $g_{DP}(i,j,n)$ be the…

We prove equivalent conditions for two-sided sub-Gaussian estimates of heat kernels on metric measure spaces.

In this paper, we prove a problem proposed by Bre\v{s}ar: for any graphs $G$ and $H$, $\Gamma(G\square H)\ge\Gamma(G)\Gamma(H)+ \min\{|V(G)|-\Gamma(G),|V(H)|-\Gamma(H)\}$, where $\Gamma(G)$ denotes the upper domination number of $G$.

In this paper, we will construct formulas and bounds for Neighborhood Degree-based indices of graphs and describe graphs that attain the bounds. Furthermore, we will establish a lower bound for the spectral radius of any graph.

We prove sharp two-sided global estimates for the heat kernel associated with a Euclidean sphere of arbitrary dimension. This solves a long-standing open problem.

In this work we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between…

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…

In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…

We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation…

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…

In this work, we study the heat equation with Grushin's operator. We present an expression for its heat kernel, prove its decay in $L^p$ spaces, and that it is an approximation of the identity. As a consequence, the heat semigroup…

Graphene was recently proposed as a material for heat removal owing to its extremely high thermal conductivity. We simulated heat propagation in silicon-on-insulator circuits with and without graphene lateral heat spreaders. Numerical…

A perfect $K_t$-matching in a graph $G$ is a spanning subgraph consisting of vertex disjoint copies of $K_t$. A classic theorem of Hajnal and Szemer\'edi states that if $G$ is a graph of order $n$ with minimum degree $\delta(G) \ge…

An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \to V(G)$ and a collection of edge-disjoint paths in $G$, one for each edge of $H$, such that the path $P_{uv}$ corresponding to edge $uv$ has endpoints $f(u)$ and…