相关论文: A simple proof of orientability in colored group f…
We consider the single-conflict coloring problem, a graph coloring problem in which each edge of a graph receives a forbidden ordered color pair. The task is to find a vertex coloring such that no two adjacent vertices receive a pair of…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
The main result of this paper is a "colored Tverberg theorem for rainbow-unavoidable complexes". This theorem may be considered as a merging of two theorems: "Tverberg theorem for collectively unavoidable complexes" and "balanced colored…
Recent investigations in computational biology focus on a family of 2-colored digraphs, called 2-colored best match graphs, which naturally arise from rooted phylogenetic trees. Actually the defining properties of such graphs are…
A {\em kernel by properly colored paths} of an arc-colored digraph $D$ is a set $S$ of vertices of $D$ such that (i) no two vertices of $S$ are connected by a properly colored directed path in $D$, and (ii) every vertex outside $S$ can…
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
We provide a short proof for the theorem that two compact Riemannian manifolds are isomorphic if and only there exists an order isomorphism which intertwines between the heat semigroups on the manifolds.
In [Pal13] (arXiv:1106.4540) the second author proved that the sequence of "oriented" configuration spaces on an open connected manifold exhibits homological stability as the number of particles goes to infinity. To complement that result…
Based on recent work on simplicial diffeomorphisms in colored group field theories, we develop a representation of the colored Boulatov model, in which the GFT fields depend on variables associated to vertices of the associated simplicial…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds…
The present paper studies the structure of characteristic varieties of fundamental groups of graph manifolds. As a consequence, a simple proof of Papadima's question is provided on the characterization of algebraic links that have…
For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [BCKKLT, IPEC '22], where the equivalence…
In this paper we study the oriented vertex and arc coloring problem on edge series-parallel digraphs (esp-digraphs) which are related to the well known series-parallel graphs. Series-parallel graphs are graphs with two distinguished…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
For $k\ge 1$, we consider interleaved $k$-tuple colorings of the nodes of a graph, that is, assignments of $k$ distinct natural numbers to each node in such a way that nodes that are connected by an edge receive numbers that are strictly…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must…