Related papers: Links associated with generic immersions of graphs

The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the sense that if a graph $G$ contains a graph $H$ as a topological minor, then it also contains it as an immersion but…

Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…

Let $\mathcal C$ be the category of finite graphs. Lov\`{a}sz shows that the semi-ring of isomorphism classes of $\mathcal C$ (with coproduct as sum, and product as multiplication) is embedded into the direct product of the semi-ring of…

Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…

In this paper we clarify the relationship between ribbon surfaces of Legendrian graphs and quasipositive diagrams by using certain fence diagrams. As an application, we give an alternative proof of a theorem concerning a relationship…

We develop the theory of multiplicative Ehresmann connections for Lie groupoid submersions covering the identity, as well as their infinitesimal counterparts. We construct obstructions to the existence of such connections, and we prove…

Given a complex of groups, we construct a new class of complex of groups that records its local data and offer a functorial perspective on the statement that complexes of groups are locally developable. We also construct a new notion of an…

We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…

We prove a 2-categorical analogue of a classical result of Drinfeld: there is a one-to-one correspondence between connected, simply-connected Poisson Lie 2-groups and Lie 2-bialgebras. In fact, we also prove that there is a one-to-one…

We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…

We define algebras of admissible functions associated to twisted Dirac structures, and we show that they are Poisson algebras. We study the standard cases associated to Dirac structures defined by graphs of non-degenerate 2-forms.

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2,r}$, as an immersion. In proving this, we develop a new tool we call a ring-decomposition. We also prove that linear…

Nash-Williams' Strong Immersion Conjecture states that graphs are well-quasi-ordered by the strong immersion relation. That is, given infinitely many graphs, one graph contains another graph as a strong immersion. In this paper we study the…

Following the lead of Stanley and Gessel, we consider a morphism which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as multivariate generating series of non-decreasing…

We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…