Related papers: Links associated with generic immersions of graphs
Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual…
We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…
I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…
A result about spanning forests for graphs yields a short proof of Krebes's theorem concerning embedded tangles in links.
We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations…
In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…
We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs intrinsically linked in projective space. We fully…
The authors establish a relation of the theory of varieties with degenerate Gauss maps in projective spaces with the theory of congruences and pseudocongruences of subspaces and show how these two theories can be applied to the construction…
We study relations between cluster algebra invariants and link invariants. First, we show that several constructions of positroid links (permutation links, Richardson links, grid diagram links, plabic graph links) give rise to isotopic…
We study the generalization of quasipositive links from the three-sphere to arbitrary closed, orientable three-manifolds. Our main result shows that the boundary of any smooth, properly embedded complex curve in a Stein domain is a…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…
The first examples of complete projective connections are uncovered: normal projective connections on surfaces whose geodesics are all closed and embedded are complete, as are normal projective connections induced from complete affine…
We show that a link in an open book can be realized as a strongly quasipositive braid if and only if it bounds a Legendrian ribbon with respect to the associated contact structure. This generalizes a result due to Baader and Ishikawa for…
Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization of directed graphs, consisting of an undirected graph…
In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…