Related papers: On the intersection ring of graph manifolds

A string graph is the intersection graph of curves in the plane. Kratochv\'il previously showed the existence of infinitely many obstacles: graphs that are not string graphs but for which any edge contraction or vertex deletion produces a…

Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental…

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…

We study path rings, Cohn path rings, and Leavitt path rings associated to directed graphs, with coefficients in an arbitrary ring $R$. For each of these types of rings, we stipulate conditions on the graph that are necessary and sufficient…

The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Each of them is isomorphic to the intersection graph of a set of axis-parallel boxes in $R^3$. These graphs were also proved to have other…

Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…

A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…

A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition…

For a Generalized Baumslag-Solitar group $G$ with underling graph a tree, we calculate the intersection $\gamma_{\omega}(G)$ of the lower central series and the intersection $(N_{p})_{\omega}(G)$ of the subgroups of finite index some power…

We show that the intersection of three subgroups in a free group is related to the computation of the third homotopy group $\pi_3$. This generalizes a result of Gutierrez-Ratcliffe who relate the intersection of two subgroups with the…

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…

In this paper we define and study a ring associated to a graph that we call the cographic toric face ring, or simply the cographic ring. The cographic ring is the toric face ring defined by the following equivalent combinatorial structures…

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing…

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

If a closed smooth manifold $M$ with an action of a torus $T$ satisfies certain conditions, then a labeled graph $\mG_M$ with labeling in $H^2(BT)$ is associated with $M$, which encodes a lot of geometrical information on $M$. For instance,…

In this paper, we discuss the entanglement properties of graph-diagonal states, with particular emphasis on calculating the threshold for the transition between the presence and absence of entanglement (i.e. the separability point). Special…

Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is 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,…