Related papers: Graph coloring manifolds
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
We introduce the notion of asymptotically finitely generated contact structures, which states essentially that the Symplectic Homology in a certain degree of any filling of such contact manifolds is uniformly generated by only finitely many…
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…
We conjecture the existence of four independent gradings in the colored HOMFLY homology. We describe these gradings explicitly for the rectangular colored homology of torus knots and make qualitative predictions of various interesting…
We introduce a representation of compact 3-manifolds without spherical boundary components via (regular) 4-colored graphs, which turns out to be very convenient for computer aided study and tabulation. Our construction is a direct…
We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…
In the way of proving Kneser's conjecture, L\'{a}szl\'{o} Lov\'{a}sz settled out a new lower bound for the chromatic number of graphs. He showed that if the hom complex $||Hom(\mathcal{K}_2, H)||$ of a graph $H$ is topologically…
The G-degree of colored graphs is a key concept in the approach to Quantum Gravity via tensor models. The present paper studies the properties of the G-degree for the large class of graphs representing singular manifolds (including closed…
We review several well-known operads of compactified configuration spaces and construct several new such operads, C, in the category of smooth manifolds with corners whose complexes of fundamental chains give us (i) the 2-coloured operad of…
The aim of this paper is two-fold. First, we give a fully geometric description of the HOMFLYPT homology of Khovanov-Rozansky. Our method is to construct this invariant in terms of the cohomology of various sheaves on certain algebraic…
We present examples of color Hopf algebras, i.e. Hopf algebras in color categories (braided tensor categories with braiding induced by a bicharacter on an abelian group), related with quantum doubles of pointed Hopf algebras. We also…
We study Lefschetz pencils on symplectic four-manifolds via the associated spheres in the moduli spaces of curves, and in particular their intersections with certain natural divisors. An invariant defined from such intersection numbers can…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…
The main purpose of this paper is to define representations and a cohomology of color Hom-Lie algebras and to study some key constructions and properties. We describe Hartwig-Larsson-Silvestrov Theorem in the case of $\Gamma$-graded…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
We solve the isomorphism problem for the whole class of Lins-Mandel gems (graphs encoded manifolds). We also present certain homeomorphisms of branched cyclic coverings of two-bridge hyperbolic links. As a consequence, we prove that, in in…