Smaller universal targets for homomorphisms of edge-colored graphs

2021 ◽  
Author(s):  
Grzegorz Guśpiel
Keyword(s):  
Colored Graphs

Rainbow paths and trees in properly-colored graphs

2017 ◽  
Author(s):  
Isaac Clarence Wass
Keyword(s):  
Colored Graphs

scholarly journals Indirect identification of horizontal gene transfer

2021 ◽  
Vol 83 (1) ◽  
Author(s):  
David Schaller ◽  
Manuel Lafond ◽  
Peter F. Stadler ◽  
Nicolas Wieseke ◽  
Marc Hellmuth
Keyword(s):  
Gene Transfer ◽  
Horizontal Gene Transfer ◽  
Polynomial Time ◽  
Divergence Time ◽  
Recognition Algorithm ◽  
Vertex Coloring ◽  
Implicit Methods ◽  
Colored Graphs ◽  
Wide Range ◽  
Complete Multipartite

AbstractSeveral implicit methods to infer horizontal gene transfer (HGT) focus on pairs of genes that have diverged only after the divergence of the two species in which the genes reside. This situation defines the edge set of a graph, the later-divergence-time (LDT) graph, whose vertices correspond to genes colored by their species. We investigate these graphs in the setting of relaxed scenarios, i.e., evolutionary scenarios that encompass all commonly used variants of duplication-transfer-loss scenarios in the literature. We characterize LDT graphs as a subclass of properly vertex-colored cographs, and provide a polynomial-time recognition algorithm as well as an algorithm to construct a relaxed scenario that explains a given LDT. An edge in an LDT graph implies that the two corresponding genes are separated by at least one HGT event. The converse is not true, however. We show that the complete xenology relation is described by an rs-Fitch graph, i.e., a complete multipartite graph satisfying constraints on the vertex coloring. This class of vertex-colored graphs is also recognizable in polynomial time. We finally address the question “how much information about all HGT events is contained in LDT graphs” with the help of simulations of evolutionary scenarios with a wide range of duplication, loss, and HGT events. In particular, we show that a simple greedy graph editing scheme can be used to efficiently detect HGT events that are implicitly contained in LDT graphs.

scholarly journals Path homology theory of edge-colored graphs

2021 ◽  
Vol 19 (1) ◽  
pp. 706-723
Author(s):  
Yuri V. Muranov ◽  
Anna Szczepkowska
Keyword(s):  
Spectral Sequence ◽  
Edge Coloring ◽  
Homology Theory ◽  
Homotopy Category ◽  
Homology Groups ◽  
Colored Graphs ◽  
Natural Filtration ◽  
Definition Of ◽  
Exact Sequences

Abstract In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau. We give the construction of the path homology theory for edge-colored graphs that follows immediately from the consideration of natural functor from the category of graphs to the subcategory of symmetrical digraphs. We describe the natural filtration of path homology groups of any digraph equipped with edge coloring, provide the definition of the corresponding spectral sequence, and obtain commutative diagrams and braids of exact sequences.

scholarly journals The Action of the Weyl Group on the $$E_8$$ Root System

2021 ◽  
Author(s):  
Rosa Winter ◽  
Ronald van Luijk
Keyword(s):  
Automorphism Group ◽  
Weyl Group ◽  
Root System ◽  
Sufficient Conditions ◽  
Maximal Clique ◽  
Necessary And Sufficient Conditions ◽  
Inner Product ◽  
Colored Graphs ◽  
Necessary And Sufficient ◽  
Root Polytope

AbstractLet $$\varGamma $$ Γ be the graph on the roots of the $$E_8$$ E 8 root system, where any two distinct vertices e and f are connected by an edge with color equal to the inner product of e and f. For any set c of colors, let $$\varGamma _c$$ Γ c be the subgraph of $$\varGamma $$ Γ consisting of all the 240 vertices, and all the edges whose color lies in c. We consider cliques, i.e., complete subgraphs, of $$\varGamma $$ Γ that are either monochromatic, or of size at most 3, or a maximal clique in $$\varGamma _c$$ Γ c for some color set c, or whose vertices are the vertices of a face of the $$E_8$$ E 8 root polytope. We prove that, apart from two exceptions, two such cliques are conjugate under the automorphism group of $$\varGamma $$ Γ if and only if they are isomorphic as colored graphs. Moreover, for an isomorphism f from one such clique K to another, we give necessary and sufficient conditions for f to extend to an automorphism of $$\varGamma $$ Γ , in terms of the restrictions of f to certain special subgraphs of K of size at most 7.

scholarly journals Finiteness for mapping class group representations from twisted Dijkgraaf–Witten theory

2018 ◽  
Vol 27 (06) ◽  
pp. 1850043 ◽  
Author(s):  
Paul P. Gustafson
Keyword(s):  
Braid Group ◽  
Mapping Class Group ◽  
Class Group ◽  
Braid Groups ◽  
Fusion Category ◽  
Mapping Class ◽  
Group Representations ◽  
Colored Graphs ◽  
Finite Image ◽  
Spanning Set

We show that any twisted Dijkgraaf–Witten representation of a mapping class group of an orientable, compact surface with boundary has finite image. This generalizes work of Etingof et al. showing that the braid group images are finite [P. Etingof, E. C. Rowell and S. Witherspoon, Braid group representations from twisted quantum doubles of finite groups, Pacific J. Math. 234 (2008)(1) 33–42]. In particular, our result answers their question regarding finiteness of images of arbitrary mapping class group representations in the affirmative. Our approach is to translate the problem into manipulation of colored graphs embedded in the given surface. To do this translation, we use the fact that any twisted Dijkgraaf–Witten representation associated to a finite group [Formula: see text] and 3-cocycle [Formula: see text] is isomorphic to a Turaev–Viro–Barrett–Westbury (TVBW) representation associated to the spherical fusion category [Formula: see text] of twisted [Formula: see text]-graded vector spaces. The representation space for this TVBW representation is canonically isomorphic to a vector space of [Formula: see text]-colored graphs embedded in the surface [A. Kirillov, String-net model of Turaev-Viro invariants, Preprint (2011), arXiv:1106.6033 ]. By analyzing the action of the Birman generators [J. Birman, Mapping class groups and their relationship to braid groups, Comm. Pure Appl. Math. 22 (1969) 213–242] on a finite spanning set of colored graphs, we find that the mapping class group acts by permutations on a slightly larger finite spanning set. This implies that the representation has finite image.

The classification of closed surfaces using colored graphs

1993 ◽  
Vol 9 (1) ◽  
pp. 75-84 ◽  
Author(s):  
Andrew Vince
Keyword(s):  
Colored Graphs ◽  
Closed Surfaces

A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA

2008 ◽  
Vol 17 (05) ◽  
pp. 579-599 ◽  
Author(s):  
MARIA RITA CASALI ◽  
PAOLA CRISTOFORI
Keyword(s):  
Automatic Generation ◽  
Computational Approach ◽  
Equivalence Classes ◽  
Colored Graphs ◽  
One To One ◽  
Genus Two ◽  
Jsj Decompositions

The present paper follows the computational approach to 3-manifold classification via edge-colored graphs, already performed in [1] (with respect to orientable 3-manifolds up to 28 colored tetrahedra), in [2] (with respect to non-orientable 3-manifolds up to 26 colored tetrahedra), in [3] and [4] (with respect to genus two 3-manifolds up to 34 colored tetrahedra): in fact, by automatic generation and analysis of suitable edge-colored graphs, called crystallizations, we obtain a catalogue of all orientable 3-manifolds admitting colored triangulations with 30 tetrahedra. These manifolds are unambiguously identified via JSJ decompositions and fibering structures. It is worth noting that, in the present work, a suitable use of elementary combinatorial moves yields an automatic partition of the elements of the generated crystallization catalogue into equivalence classes, which turn out to be in one-to-one correspondence with the homeomorphism classes of the represented manifolds.

scholarly journals Paths and trails in edge-colored graphs

2008 ◽  
Vol 409 (3) ◽  
pp. 497-510 ◽  
Author(s):  
A. Abouelaoualim ◽  
K.Ch. Das ◽  
L. Faria ◽  
Y. Manoussakis ◽  
C. Martinhon ◽  
...  
Keyword(s):  
Colored Graphs
Sign in / Sign up

Export Citation Format

Share Document