Related papers: On the support of a non-autocorrelated function on…

Let $\phi(k)$ be the minimum number of vertices in a non-$k$-choosable $k$-chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that $\phi(k) \ge 2k+2$. This bound is tight if $k$ is even. If $k$ is odd, then it is…

Suppose n>2, let M,M' be n-dimensional connected complete finite-volume hyperbolic manifolds with non-empty geodesic boundary, and suppose that the fundamental group of M is quasi-isometric to the fundamental group of M' (with respect to…

For a hypergraph $H$, let $q(H)$ denote the expected number of monochromatic edges when the color of each vertex in $H$ is sampled uniformly at random from the set of size 2. Let $s_{\min}(H)$ denote the minimum size of an edge in $H$.…

We prove that if a countable group $\Gamma$ contains infinite commuting subgroups $H, H'\subset \Gamma$ with $H$ non-amenable and $H'$ ``weakly normal'' in $\Gamma$, then any measure preserving $\Gamma$-action on a probability space which…

The strong chromatic number $\chi_{\text{s}}(G)$ of a graph $G$ on $n$ vertices is the least number $r$ with the following property: after adding $r \lceil n/r \rceil - n$ isolated vertices to $G$ and taking the union with any collection of…

This paper shows that many hyperbolic manifolds obtained by glueing arithmetic pieces embed into higher-dimensional hyperbolic manifolds as codimension-one totally geodesic submanifolds. As a consequence, many Gromov--Pyatetski-Shapiro and…

The ergodic theory and geometry of the Julia set of meromorphic functions on the complex plane with polynomial Schwarzian derivative is investigated under the condition that the forward trajectory of asymptotic values in the Julia set is…

The mapping class group $\Gamma$ of the complement of a Cantor set in the plane arises naturally in dynamics. We show that the ray graph, which is the analog of the complex of curves for this surface of infinite type, has infinite diameter…

Let $\Gamma$ be a discrete countable group acting isometrically on a measurable field $\mathbf{X}$ of CAT(0)-spaces of finite telescopic dimension over some ergodic standard Borel probability $\Gamma$-space $(\Omega,\mu)$. If $\mathbf{X}$…

Let $f$ be a Morse function on a closed surface $\Sigma$ such that zero is a regular value and such that $f$ admits neither positive minima nor negative maxima. In this expository note, we show that $\Sigma\times \mathbb{R}$ admits an…

Let $\text{G}(n)$ be equal either to $\text{PO}(n,1),\text{PU}(n,1)$ or $\text{PSp}(n,1)$ and let $\Gamma \leq \text{G}(n)$ be a uniform lattice. Denote by $\mathbb{H}^n_K$ the hyperbolic space associated to $\text{G}(n)$, where $K$ is a…

The Goldberg-Seymour Conjecture for $f$-colorings states that the $f$-chromatic index of a loopless multigraph is essentially determined by either a maximum degree or a maximum density parameter. We introduce an oriented version of…

For $n\geq 2$, let $\Gamma\subset \mathrm{SU}((n,1),\mathcal{O}_{K})$ be a torsion-free, finite-index subgroup, where $\mathcal{O}_K$ denotes the ring of integers of a totally imaginary number field $K$ of degree $2$. Let $\mathbb{B}^n$…

A $k$-uniform hypergraph $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that every edge in $E$ contains precisely one vertex from each $V_i$. We call such a graph $n$-balanced if $|V_i| = n$ for…

Associated to any finite simple graph $\Gamma$ is the chromatic polynomial $P_\Gamma(q)$ whose complex zeroes are called the chromatic zeros of $\Gamma$. A hierarchical lattice is a sequence of finite simple graphs…

Under mild topological restrictions, we obtain new linear upper bounds for the dimension of the mod $p$ homology (for any prime $p$) of a finite-volume orientable hyperbolic $3$ manifold $M$ in terms of its volume. A surprising feature of…

If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few…

We initiate the study of chromatic numbers for contact graphs of configurations of integer-sized cuboids in three dimensions, all of which are mutually congruent. Disallowing rotations, we show a global upper bound of 8 for the chromatic…

Given a graph $G$, let $\Delta_2(G)$ denote the maximum number of neighbors any two distinct vertices of $G$ have in common. Vu (2002) proposed that, provided $\Delta_2(G)$ is not too small as a proportion of the maximum degree $\Delta(G)$…

An $(a:b)$-coloring of a graph $G$ is a function $f$ which maps the vertices of $G$ into $b$-element subsets of some set of size $a$ in such a way that $f(u)$ is disjoint from $f(v)$ for every two adjacent vertices $u$ and $v$ in $G$. The…