Related papers: $N$-quandles of spatial graphs

A special case of a theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured a generalization of this result to arbitrary finite…

This paper treats some basic points in general relativity and in its perturbative analysis. Firstly a systematic classification of global SO(n) invariants, which appear in the weak-field expansion of n-dimensional gravitational theories, is…

We prove a strong form of finite rigidity for pants graphs of spheres. Specifically, for any $n\geq4$, we construct a finite subgraph $X_n$ of the pants graph $P(S_{0,n})$ of the n-punctured sphere $S_{0,n}$ with the following property. Any…

Since proof-nets for MLL- were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof based on properties of subnets (empires and kingdoms) and…

We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…

A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for…

A quandle coloring quiver is a quiver structure, introduced by Karina Cho and Sam Nelson, which is defined on the set of quandle colorings of an oriented knot or link by a finite quandle. We study quandle coloring quivers of (p, 2)-torus…

We defined a grid homology theory for spatial graphs. We showed that the skein exact sequence of singular knots can be extended to our grid homology for spatial graphs.

We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…

This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…

According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…

A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

We define a quandle variety as an irreducible algebraic variety $Q$ endowed with an algebraically defined quandle operation $\rhd$. It can also be seen as an analogue of a generalized affine symmetric space or a regular $s$-manifold in…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…

End vertices of graph searches can exhibit strong structural properties and are crucial for many graph algorithms. The problem of deciding whether a given vertex of a graph is an end-vertex of a particular search was first introduced by…

We consider a class of topological objects in the 3-sphere $S^3$ which will be called $n$-punctured ball tangles. Using the Kauffman bracket at $A=e^{i \pi/4}$, an invariant for a special type of $n$-punctured ball tangles is defined. The…

An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…