相关论文: Sharp Davies-Gaffney-Grigor'yan Lemma on Graphs

In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability of auxiliary hypergraphs. Our main technical result gives…

On doubling metric measure spaces endowed with a strongly local regular Dirichlet form, we show some characterisations of pointwise upper bounds of the heat kernel in terms of global scale-invariant inequalities that correspond respectively…

The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

We consider a graphene sheet folded in an arbitrary geometry, compact or with nanotube-like open boundaries. In the continuous limit, the Hamiltonian takes the form of the Dirac operator, which provides a good description of the low energy…

The Havel-Hakimi algorithm iteratively reduces the degree sequence of a graph to a list of zeroes. As shown by Favaron, Mah\'eo, and Sacl\'e, the number of zeroes produced, known as the residue, is a lower bound on the independence number…

Many real-world networks can be modeled as graphs. Finding dense subgraphs is a key problem in graph mining with applications in diverse domains. In this paper, we consider two variants of the densest subgraph problem where multiple graph…

We obtain pointwise lower bounds for heat kernels of higher order differential operators with Dirichlet boundary conditions on bounded domains in $\R^N$. The bounds exhibit explicitly the nature of the spatial decay of the heat kernel close…

Szemer\'edi's Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of the Regularity Lemma for sparse graphs, but these only apply when the graph satisfies some local density condition. In…

Kernels on graphs have had limited options for node-level problems. To address this, we present a novel, generalized kernel for graphs with node feature data for semi-supervised learning. The kernel is derived from a regularization…

This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

The celebrated Hajnal-Szemer\'edi theorem gives the precise minimum degree threshold that forces a graph to contain a perfect K_k-packing. Fischer's conjecture states that the analogous result holds for all multipartite graphs except for…

In this paper, we obtain an explicit formula for the heat kernel on the infinite Cayley graph of the modular group $\operatorname{PSL}_2\mathbb{Z}$, given by the presentation $\langle a,b\mid a^2=1, b^3=1\rangle$. Our approach extends the…

The maximum entropy principle is applied to the formal derivation of isothermal, Euler-like equations for semiclassical fermions (electrons and holes) in graphene. After proving general mathematical properties of the equations so obtained,…

We consider graphs associated to Delone sets in Euclidean space. Such graphs arise in various ways from tilings. Here, we provide a unified framework. In this context, we study the associated Laplace operators and show Gaussian heat kernel…

We obtain two-sided heat kernel estimates for Riemannian manifolds with ends with mixed boundary condition, provided that the heat kernels for the ends are well understood. These results extend previous results of Grigor'yan and…

We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…

In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…

We consider the monomer-dimer model on weighted graphs embedded in surfaces with boundary, with the restriction that only monomers located on the boundary are allowed. We give a Pfaffian formula for the corresponding partition function,…