Related papers: Adequate links in thickened surfaces and the gener…
We generalize a theorem of Finkelstein and Moriah and show that if a link $L$ has a $2n$-plat projection satisfying certain conditions, then its complement contains some closed essential surfaces. In most cases these surfaces remain…
Menasco showed that a closed surface in the complement of a non-split prime alternating link in $S^3$ contains a circle isotopic in the link complement to a meridian of the links. This result is known as the meridian lemma for alternating…
We consider hyperbolic links that admit alternating projections on surfaces in compact, irreducible 3-manifolds. We show that, under some mild hypotheses, the volume of the complement of such a link is bounded below in terms of a Kauffman…
By introducing a finer version of the Kauffman bracket skein algebra, we show how to decompose the Kauffman bracket skein algebra of a surface into elementary blocks corresponding to the triangles in an ideal triangulation of the surface.…
We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a $k$-vertex-connected orientation. We prove that a connectivity of order $O(k^2)$ suffices. As a key tool,…
The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollob\'as-Riordan polynomial of a ribbon graph associated to one of the link's…
We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
We introduce a new technique for showing classical knots and links are not slice. As one application we resolve a long-standing question as to whether certain natural families of knots contain topologically slice knots. We also present a…
A graph on $n \ge 3$ vertices drawn in the plane such that each edge is crossed at most four times has at most $6(n-2)$ edges -- this result proven by Ackerman is outstanding in the literature of beyond-planar graphs with regard to its…
Thin spanning trees lie at the intersection of graph theory, approximation algorithms, and combinatorial optimization. They are central to the long-standing \emph{thin tree conjecture}, which asks whether every $k$-edge-connected graph…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…
We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
We look at complete minimal surfaces of finite total curvature in $\mathbb{R}^4$. Similarly to the case of complex curves in $\mathbb{C}^2$ we introduce their {\it link at infinity}; we derive the {\it writhe number at infinity} which gives…
It is known that the Kauffman-Murasugi-Thislethwaite type inequality becomes an equality for any (possibly virtual) adequate link diagram. We refine this condition. As an application we obtain a criterion for virtual link diagram with…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link.…
We extend the flyping theorem to alternating links in thickened surfaces and alternating virtual links. The proof of the former result uses work of Boden--Karimi to adapt the author's geometric proof of Tait's 1898 flyping conjecture (first…