Related papers: Finite Rigid Sets in Flip Graphs

We investigate properties of sparse and tight surface graphs. In particular we derive topological inductive constructions for $(2, 2)$-tight surface graphs in the case of the sphere, the plane, the twice punctured sphere and the torus. In…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

Let $f:X-->Y$ be a map of algebraic varieties. Barthel, Brasselet, Fieseler, Gabber and Kaup have shown that there exists a homomorphism of intersection homology groups $f^*:IH^*(Y)-->IH^*(X)$ compatible with the induced homomorphism on…

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

We show that an oriented surface in $\mathbb{R}^4$ containing double point singularities induces a map between the Khovanov homology groups of its boundary links in a functorial way. As part of this work, the movie moves of Carter and Saito…

We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.

We construct a smooth rational affine surface S with finite automorphism group but with the property that the group of automorphisms of the cylinder SxA^2 acts infinitely transitively on the complement of a closed subset of codimension at…

We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.

Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…

A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

The aim of this paper is twofold. First of all, we confirm a few basic criteria of the finiteness of real forms of a given smooth complex projective variety, in terms of the Galois cohomology set of the discrete part of the automorphism…

There are several different extensions of the Tutte polynomial to graphs embedded in surfaces. To help frame the different options, here we consider the problem of extending the Tutte polynomial to cellularly embedded graphs starting from…

The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…

A flip of a graph is obtained by complementing the edge relation within a set of vertices. Flips are typically used to separate vertices in a graph, by increasing the distances between them. We show that in $K_{t,t}$-free graphs, every…