Related papers: On embeddings of CAT(0) cube complexes into produc…
In 2020, Behr defined the problem of edge coloring of signed graphs and showed that every signed graph $(G, \sigma)$ can be colored using exactly $\Delta(G)$ or $\Delta(G) + 1$ colors, where $\Delta(G)$ is the maximum degree in graph $G$.…
In this paper we prove that the asymptotic dimension of a finite-dimensional CAT(0) cube complex is bounded above by the dimension. To achieve this we prove a controlled colouring theorem for the complex. We also show that every CAT(0) cube…
A graph $G=(V,E)$ is geometrically embeddable into a normed space $X$ when there is a mapping $\zeta: V\to X$ such that $\|\zeta(v)-\zeta(w)\|_X\leqslant 1$ if and only if $\{v,w\}\in E$, for all distinct $v,w\in V$. Our result is the…
For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_\Delta\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare…
The quadratic embedding constant (QEC) of a finite, simple, connected graph $G$ is the maximum of the quadratic form of the distance matrix of $G$ on the subset of the unit sphere orthogonal to the all-ones vector. The study of these QECs…
Given a CAT(0) cube complex X, we show that if Aut(X) $\neq$ Isom(X) then there exists a full subcomplex of X which decomposes as a product with $\mathbb{R}^n$. As applications, we prove that if X is $\delta$-hyperbolic, cocompact and…
Let $F$ be a family of connected bipartite graphs, each with at least three vertices. A proper vertex colouring of a graph $G$ with no bichromatic subgraph in $F$ is $\F$-free. The $F$-free chromatic number $\chi(G,F)$ of a graph $G$ is the…
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…
The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…
This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise…
We study quasiisometric embeddings between finite-dimensional CAT(0) cube complexes. More specifically, we introduce geometric branching conditions under which flats in the domain, not necessarily of top rank, are mapped within finite…
We examine a graph $\Gamma$ encoding the intersection of hyperplane carriers in a CAT(0) cube complex $\widetilde X$. The main result is that $\Gamma$ is quasi-isometric to a tree. This implies that a group $G$ acting properly and…
A proper conflict-free colouring of a graph is a colouring of the vertices such that any two adjacent vertices receive different colours, and for every non-isolated vertex $v$, some colour appears exactly once on the neighbourhood of $v$.…
We prove that an open manifold $M$ of dimension at least $5$ which admits a complete CAT(0) polyhedral metric is pseudo-collarable, its fundamental group at infinity is strongly perfectly semistable and has vanishing Chapman-Siebenmann…
We prove upper and lower bounds on the chromatic number of the square of the cartesian product of trees. The bounds are equal if each tree has even maximum degree.
A colouring of a graph $G$ has clustering $k$ if the maximum number of vertices in a monochromatic component equals $k$. Motivated by recent results showing that many natural graph classes are subgraphs of the strong product of a graph with…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
Given an edge colouring of a graph with a set of $m$ colours, we say that the graph is $m$-\textit{coloured} if each of the $m$ colours is used. For an $m$-colouring $\Delta$ of $\mathbb{N}^{(2)}$, the complete graph on $\mathbb{N}$, we…
It is proved that all 4-edge-colourings of a (sub)cubic graph are Kempe equivalent. This resolves a conjecture of the second author. In fact, it is found that the maximum degree Delta=3 is a threshold for Kempe equivalence of…