Related papers: Signed projective cubes, a homomorphism point of v…
The relationship between convex geometry and algebraic geometry has deep historical roots, tracing back to classical works in enumerative geometry. In this paper, we continue this theme by studying two interconnected problems regarding…
A meromorphic quadratic differential on a compact Riemann surface defines a complex projective structure away from the poles via the Schwarzian equation. In this article we first prove the analogue of Thurston's Grafting Theorem for the…
Vertex coloring of a graph $G$ with $n$-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of $G$ to the complete graph $K_n$ of order $n$. So, in that sense, the chromatic number $\chi(G)$ of $G$…
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…
A subgraph of the $n$-dimensional hypercube is called 'layered' if it is a subgraph of a layer of some hypercube. In this paper we show that there exist subgraphs of the cube of arbitrarily large girth that are not layered. This answers a…
A homomorphism of a signed graph $(G, \sigma)$ to $(H, \pi)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and the product of signs of closed walks are preserved.…
A signed graph $\Sigma$ is a pair $(G,\sigma)$, where $G=(V,E)$ is the underlying graph in which each edge is assigned $+1$ or $-1$ by the signature function $\sigma:E\rightarrow\{-1,+1\}$. In this paper, we extend the extensively applied…
A signed graph is a pair $(G, \sigma)$, where $G$ is a graph and $\sigma: E(G) \to \{+, -\}$ is a signature which assigns to each edge of $G$ a sign. Various notions of coloring of signed graphs have been studied. In this paper, we extend…
Cube categories are used to encode higher-dimensional categorical structures. They have recently gained significant attention in the community of homotopy type theory and univalent foundations, where types carry the structure of such higher…
We give an elementary proof for the non-$3$-colorability of $4$-chromatic Schrijver graphs thus providing such a proof also for $4$-chromatic Kneser graphs. To this end we use a complete description of the structure of $4$-chromatic…
A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors having the additional property that when looking at the set of colors assigned to any edge $e$ and the four edges adjacent it, we have either exactly five…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
Classification of noncommutative quadric hypersurfaces is one of the major projects in noncommutative algebraic geometry. In recent years, we are dedicated to complete the classification of noncommutative central conics. To achieve this…
The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with $5$ colours such that for every edge $e$, the set of colours assigned to the edges adjacent to $e$ has cardinality either $2$ or $4$,…
Similar to Euclidean geometry, graph theory is a science that studies figures that consist of points and lines. The core of Euclidean geometry is the parallel postulate, which provides the basis of the geometric invariant that the sum of…
A constrained colouring or, more specifically, an $(\alpha,\beta)$-colouring of a hypergraph $H$, is an assignment of colours to its vertices such that no edge of $H$ contains less than $\alpha$ or more than $\beta$ vertices with different…
A signed graph is a graph whose edges are signed. In a vertex-signed graph the vertices are signed. The latter is called consistent if the product of signs in every circle is positive. The line graph of a signed graph is naturally…
We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…
In a recent paper, the author and I. Zelenko introduce the concept of modified CR symbols for organizing local invariants of $2$-nondegenerate CR structures. In this paper, we consider homogeneous hypersurfaces in $\mathbb{C}^4$, a natural…