Related papers: Graph coloring manifolds
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
In this paper, some results concerning the colorings of graph powers are presented. The notion of helical graphs is introduced. We show that such graphs are hom-universal with respect to high odd-girth graphs whose $(2t+1)$st power is…
An edge-coloring of a graph $G$ assigns a color to each edge of $G$. An edge-coloring is a parity edge-coloring if for each path $P$ in $G$, it uses some color on an odd number of edges in $P$. It is a strong parity edge-coloring if for…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
A \emph{directional labeling} of an edge $\emph{uv}$ in a graph $G=(V,E)$ by an ordered pair $ab$ is a labeling of the edge $uv$ such that the label on $uv$ in the direction from $u$ to $v$ is $\ell(uv)=ab$, and $\ell(vu)=ba$. New…
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…
We derive an obstruction to representing a homology class of a symplectic 4-manifold by an embedded, possibly disconnected, symplectic surface.
In this paper we study a natural extension of Kontsevich's characteristic class construction for A-infinity and L-infinity algebras to the case of curved algebras. These define homology classes on a variant of his graph homology which…
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom(C_m,K_n). We perform the computation first with Z_2, and then with integer coefficients. The main technical tool is to use…
This is an example on the cohomology of threefolds.
In this article, we give conditions on a graph under which the Lov\'{a}sz' original bound of the graph can be improved by increasing the topological connectivity of its neighbourhood complex. We also work out conditions under which…
We study the space of pseudo-holomorphic spheres in compact symplectic manifolds with convex boundary. We show that the theory of Gromov-Witten invariants can be extended to the class of semi-positive manifolds with convex boundary. This…
We prove several claims made by Kontsevich about the orbifold Euler characteristic of the three types of graph homology introduced by him. For this purpose, first we develop a simplified version of the Feynman diagram method, which requires…
We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
We study graph complexes related to configuration spaces and diffeomorphism groups of highly connected manifolds of odd dimension. In particular we compute the cohomology in the "high genus" limit. This paper is a continuation of previous…