Related papers: Deformations of box complexes
We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation…
The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on…
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…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
In this paper, we introduce the notion of crossed homomorphisms between Lie-Yamaguti algebras and establish the cohomology theory of crossed homomorphisms via the Yamaguti cohomology. Consequently, we use this cohomology to characterize…
We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum chromatic numbers are smaller than the classical chromatic…
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for…
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We show that various uncountable Borel chromatic numbers of…
In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order…
We show that for a gradable finite dimensional algebra the perfect complexes and bounded derived category cannot be distinguished by homotopy invariants.
We investigate group-theoretic "signatures" of odd cycles of a graph, and their connections to topological obstructions to 3-colourability. In the case of signatures derived from free groups, we prove that the existence of an odd cycle with…
The $\mathbb{Z}_2$-index ${\rm ind}(X)$ of a $\mathbb{Z}_2$-CW-complex $X$ is the smallest number $n$ such that there is a $\mathbb{Z}_2$-map from $X$ to $S^n$. Here we consider $S^n$ as a $\mathbb{Z}_2$-space by the antipodal map.…
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…
We show that the dominance complex $\mathcal{D}(G)$ of a graph $G$ coincides with the combinatorial Alexander dual of the neighborhood complex $\mathcal{N}(\overline{G})$ of the complement of $G$. Using this, we obtain a relation between…
A box is the cartesian product of real intervals, which are either bounded or equal to $\mathbb{R}$. A box is said to be $d$-local if at most $d$ of the intervals are bounded. In this paper, we investigate the recently introduced local…
The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for…
As previously known, all 3-manifolds of genus two can be represented by edge-coloured graphs uniquely defined by 6-tuples of integers satisfying simple conditions. The present paper describes an ``elementary transformation'' on these…
We study the box dimensions of sets invariant under the toral endomorphism $(x, y) \mapsto (m x \text{ mod } 1, \, n y \text{ mod } 1)$ for integers $n>m \geq 2$. The basic examples of such sets are Bedford-McMullen carpets and, more…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…