Related papers: A simple proof of orientability in colored group f…
Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The…
We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We derive a lower bound…
We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…
In this paper, we consider coloring of graphs under the assumption that some vertices are already colored. Let $G$ be an $r$-colorable graph and let $P\subset V(G)$. Albertson [J.\ Combin.\ Theory Ser. B \textbf{73} (1998), 189--194] has…
The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds…
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…
We develop a theory on a topologically non-trivial manifold which leads to different vacuum backgrounds at the field level. The different colors of the same quark flavor live in different backgrounds generated by the action of the torsion…
We say that an edge colouring $c$ of a graph preserves an automorphism $\varphi$ if $\varphi$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $\varphi$. We call an automorphism of a graph small if it moves…
Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.
Partial polarization is the manifestation of the correlation between two mutually orthogonal transverse field components associated with a light beam. We show both theoretically and experimentally that the origin of this correlation can be…
We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it…
We consider translation surfaces with poles on surfaces. We shall prove that any finite group appears as the automorphism group of some translation surface with poles. As a direct consequence we obtain the existence of structures achieving…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…
Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…
Let $\Gamma_g$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We introduce a combinatorial structure of "core surfaces", that represent subgroups of $\Gamma_g$. These structures are (usually)…
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…
We prove that the homology of the mapping class groups of non-orientable surfaces stabilizes with the genus of the surface. Combining our result with recent work of Madsen and Weiss, we obtain that the classifying space of the stable…
We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the…
In fields ranging from business to systems biology, directed graphs with edges labeled by signs are used to model systems in a simple way: the nodes represent entities of some sort, and an edge indicates that one entity directly affects…