相关论文: On the support of a non-autocorrelated function on…

Let $M$ be a closed hyperbolic 3-manifold that admits no infinitesimal conformally-flat deformations. Examples of such manifolds were constructed by Kapovich. Then if $g$ is a Riemannian metric on $M$ with scalar curvature greater than or…

Let $\Gamma$ be a Gromov hyperbolic group, endowed with an arbitrary left-invariant hyperbolic metric, quasi-isometric to a word metric. The action of $\Gamma$ on its boundary $\partial\Gamma$ endowed with the Patterson-Sullivan measure…

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

We give sharp bounds for the hyperbolic curvature of the level curve $|z|=|f(z)|$, when $f:\mathbb{D}\to\mathbb{D}$ is holomorphic on the unit disc $\mathbb{D}$ and $f(0)\neq0$, as well as for other related level curves. As a consequence,…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

Given a graph $G$, we let $s^+(G)$ denote the sum of the squares of the positive eigenvalues of the adjacency matrix of $G$, and we similarly define $s^-(G)$. We prove that \[\chi_f(G)\ge…

Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds…

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

A fractional colouring of a graph $G$ is a function that assigns a non-negative real value to all possible colour-classes of $G$ containing any vertex of $G$, such that the sum of these values is at least one for each vertex. The fractional…

We consider a $\pi_{1}$--injective immersion $f:\Sigma\to M$ from a compact surface $\Sigma$ to a hyperbolic 3--manifold $M$. Let $\Gamma$ denote the copy of $\pi_{1}\Sigma$ in $\mathrm{Isom}({\mathbb{H}}^{3})$ induced by the immersion and…

Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…

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…

Given a finitely generated subgroup $\Gamma \le \mathrm{Out}(\mathbb{F})$ of the outer automorphism group of the rank $r$ free group $\mathbb{F} = F_r$, there is a corresponding free group extension $1 \to \mathbb{F} \to E_{\Gamma} \to…

We investigate the geometry of the graphs of nonseparating curves for surfaces of finite positive genus with potentially infinitely many punctures. This graph has infinite diameter and is known to be Gromov hyperbolic by work of the author.…

We develop an improved bound for the chromatic number of graphs of maximum degree $\Delta$ under the assumption that the number of edges spanning any neighbourhood is at most $(1-\sigma)\binom{\Delta}{2}$ for some fixed $0<\sigma<1$. The…

For any $r$-uniform hypergraph $\mathcal{H}$ with $m$ ($\geq 2$) edges, let $P(\mathcal{H},k)$ and $P_l(\mathcal{H},k)$ be the chromatic polynomial and the list-color function of $\mathcal{H}$ respectively, and let $\rho(\mathcal{H})$…

We study the $\Gamma$-convergence of sequences of free-discontinuity functionals depending on vector-valued functions $u$ which can be discontinuous across hypersurfaces whose shape and location are not known a priori. The main novelty of…

Circular $r$-coloring of a signed graph $(G,\sigma)$ is a mapping of its vertices to a circle of circumference $r$ such that: I. each pair of vertices with a negative connection is at distance at least $1$, and II. for each pair with a…

It is shown that for any fixed $c \geq 3$ and $r$, the maximum possible chromatic number of a graph on $n$ vertices in which every subgraph of radius at most $r$ is $c$ colorable is $\tilde{\Theta}\left(n ^ {\frac{1}{r+1}} \right)$ (that…