Related papers: Coloring Groups
In this paper, we consider categories with colored morphisms and functors such that morphisms assigned to morphisms with a common color have a common color. In this paper, we construct a morphism-colored functor such that any…
In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex. Using this…
A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes…
In \cite{striker2018rowmotion} Striker generalized Cameron and Fon-Der-Flaass's notion of a toggle group. In this paper we begin the study of transitive generalized toggle groups that contain a cycle. We first show that if such a group has…
This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…
Consider edge colorings of digraphs where edges $v_1 v_2$ and $v_2 v_3$ have different colors. This coloring induces a vertex coloring by sets of edge colors, in which edge $v_1 v_2$ in the graph implies that the set color of $v_1$ contains…
In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…
We introduce the notion of a coloring of a poset, which consists of a labeling of the edges in its Hasse diagram by elements in a given group $G$. We use $G$-colorings to describe the covering maps of posets and present a new method based…
We establish conditions for a permutation group generated by a single permutation of a prime power order to be an automorphism group of a graph or an edge-colored graph. This corrects and generalizes the results of the two papers on cyclic…
Following Penrose, we introduce a family of graph functions defined in terms of contractions of certain products of symmetric tensors along the edges of a graph. Special cases of these functions enumerate edge colorings and cycles of…
In this paper, we analyze the toggle group on the set of antichains of a poset. Toggle groups, generated by simple involutions, were first introduced by Cameron and Fon-Der-Flaass for order ideals of posets. Recently Striker has motivated…
We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
The jigsaw percolation process, introduced by Brummitt, Chatterjee, Dey and Sivakoff, was inspired by a group of people collectively solving a puzzle. It can also be seen as a measure of whether two graphs on a common vertex set are…
We investigate the complexity of generalizations of colourings (acyclic colourings, $(k,\ell)$-colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured,…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…
In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical…
A gain graph is a graph whose edges are labelled invertibly by "gains" from a group. "Switching" is a transformation of gain graphs that generalizes conjugation in a group. A "weak chromatic function" of gain graphs with gains in a fixed…
In this short note we use results from the theory of crystallizations to prove that color in group field theories garantees orientability of the piecewise linear pseudo-manifolds associated to each graph generated perturbatively. The origin…