相关论文: A graph counterexample to davies' conjecture

An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph $G$ is said to be $(2,3)$-orientable if there exists a friendly…

It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.

A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…

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 these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of…

We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…

We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.

In this article we study the notion of capacity of a vertex for infinite graphs over non-Archimedean fields. In contrast to graphs over the real field monotone limits do not need to exist. Thus, in our situation next to positive and null…

We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

We give a counterexample to a conjecture of D.H. Gottlieb and prove a strengthened version of it. The conjecture says that a map from a finite CW-complex X to an aspherical CW-complex Y with non-zero Euler characteristic can have…

The first heat kernel coefficients are calculated for a dispersive ball whose permittivity at high frequency differs from unity by inverse powers of the frequency. The corresponding divergent part of the vacuum energy of the electromagnetic…

Let $\Omega$ be an open set in a complete, smooth, non-compact, $m$-dimensional Riemannian manifold $M$ without boundary, where $M$ satisfies a two-sided Li-Yau gaussian heat kernel bound. It is shown that if $\Omega$ has infinite measure,…

A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…

Let $G$ be a graph with a vertex colouring $\alpha$. Let $a$ and $b$ be two colours. Then a connected component of the subgraph induced by those vertices coloured either $a$ or $b$ is known as a Kempe chain. A colouring of $G$ obtained from…

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…

In this note we give a counterexample to a conjecture proposed by Ciliberto about special linear systems of P^n through multiple base points.

A directed graph $D=(V(D),A(D))$ has a kernel if there exists an independent set $K\subseteq V(D)$ such that every vertex $v\in V(D)-K$ has an ingoing arc $u\mathbin{\longrightarrow}v$ for some $u\in K$. There are directed graphs that do…

Hadwiger's conjecture asserts that every graph with chromatic number $t$ contains a complete minor of order $t$. Given integers $n \ge 2k+1 \ge 5$, the Kneser graph $K(n, k)$ is the graph with vertices the $k$-subsets of an $n$-set such…