Related papers: Configuration Graph Cohomology

An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the…

We realize any space of conformal blocks attached to a punctured curve inside the cohomology of a configuration space of that curve and compare the WZW connection with the Gauss-Manin connection.

A topological space is introduced in this paper. Just liking the plane, it's continuous, however its $n+1$ regions couldn't be mutually adjacent. Some important phenomenon about its cross-section are discussed. The geometric generating…

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

Let $G$ be a graph whose edges are each assigned one of the $m$-colours $1, 2, \ldots, m$, and let $\Gamma$ be a subgroup of $S_m$. The operation of switching at a vertex $x$ with respect $\pi \in \Gamma$ permutes the colours of the edges…

The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…

In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…

For a given bundle $\xi \colon E \to M$ over a manifold, configuration-section spaces on $\xi$ parametrise finite subsets $z \subseteq M$ equipped with a section of $\xi$ defined on $M \smallsetminus z$, with prescribed "charge" in a…

It has recently been observed that, in contrast to the classical case, holomorphic structures on line bundles over the quantum projective line are not uniquely determined by degree. We formulate a fixed-point-theoretic framework for the…

Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…

We prove a homological stability theorem for certain complements of symmetric spaces. This is a variant of a conjecture by Vakil and Matchett Wood for subspaces of $\mathrm{Sym}^n(X)$ where $X$ is an open manifold admitting a boundary. To…

In [1] we introduced the concept of structured space, which is a topological space that locally resembles some algebraic structures. In [2] we proceeded the study of these spaces, developing two cohomology theories. The aim of this paper is…

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…

We define algebraic structures on graph cohomology and prove that they correspond to algebraic structures on the cohomology of the spaces of imbeddings of S^1 or R into R^n. As a corollary, we deduce the existence of an infinite number of…

The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…

We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…

Given an undirected graph $G=(V,E)$ with a set of vertices $V$ and a set of edges $E$, a graph coloring problem involves finding a partition of the vertices into different independent sets. In this paper we present a new framework that…