Related papers: Configuration Graph Cohomology
We prove a suite of results classifying holomorphic maps between configuration spaces of Riemann surfaces; we consider both the ordered and unordered setting as well as the cases of genus zero, one, and at least two. We give a complete…
In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…
Configuration spaces of distinct labeled points on the plane are of practical relevance in designing safe control schemes for Automated Guided Vehicles (robots) in industrial settings. In this announcement, we consider the problem of the…
This paper continues the investigation of the configuration space of two distinct points on a graph. We analyze the process of adding an additional edge to the graph and the resulting changes in the topology of the configuration space. We…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…
We construct a configuration space model for a particular 2-colored differential graded operad encoding the structure of two $A_\infty$ algebras with two $A_\infty$ morphisms and a homotopy between the morphisms. The cohomology of this…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
In this paper, we study Dehn colorings of spatial graph diagrams, and classify the vertex conditions, equivalently the palettes. We give some example of spatial graphs which can be distinguished by the number of Dehn colorings with…
Configuration space integrals are powerful tools for studying the homotopy type of the space of long embeddings in terms of a combinatorial object called a graph complex. It is unknown whether these integrals give a cochain map due to…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…
We define the fundamental quandle of a spatial graph and several invariants derived from it. In the category of graph tangles, we define an invariant based on the walks in the graph and cocycles from nonabelian quandle cohomology.
We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…