Related papers: The Tait conjecture in g(S^1xS^2)

Given integers g_i > 1 (i=1,...,n) we prove that there exist infinitely may knots K_i in S^3 so that g(E(K_i)) = g_i and the Heegaard genus of the exterior of the connected sum of K_1,...,K_n is the sum the Heegaard genera of K_1,...,K_n,…

The classical Tait-Kneser theorem states that the osculating circles of a smooth plane curve, free from curvature extrema, are pairwise disjoint. We prove a number of analogs of this theorem, e.g., for ovals of osculating cubics, osculating…

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…

It was independently conjectured by H\"aggkvist in 1989 and Kriesell in 2011 that given a positive integer $\ell$, every simple eulerian graph with high minimum degree (depending on $\ell$) admits an eulerian tour such that every segment of…

Tate sequences are an important tool for tackling problems related to the (ill-understood) Galois structure of groups of $S$-units. The relatively recent Tate sequence "for small $S$" of Ritter and Weiss allows one to use the sequence…

Kakimizu complexes have been found for several classes of links. O.Kakimizu found the Kakimizu complexes of knots with crossing number less than or equal to 10. Hatcher and Thurston found the 0-skeleton of the Kakimizu complex of 2-bridge…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$, where $t = \max\{|X|,|Y |\}$, contains a subtree $T' \cong T$ such that $G-V(T')$…

The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…

The Vol-Det Conjecture relates the volume and the determinant of a hyperbolic alternating link in $S^3$. We use exact computations of Mahler measures of two-variable polynomials to prove the Vol-Det Conjecture for many infinite families of…

The Alexander polynomial (1928) is the first polynomial invariant of links devised to help distinguish links up to isotopy. Fox's conjecture (1962) -- stating that the absolute values of the coefficients of the Alexander polynomial for any…

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

Albertson conjectured that every graph with chromatic number $r$ has crossing number at least the crossing number of the complete graph $K_r$. This conjecture was proved for $r\le 12$ by Albertson, Cranston, and Fox; for $r\le 16$ by…

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1, B_2, \ldots, B_k$ of a longest cycle $L$ in a $2$-connected…

The Tait-Kneser theorem states that the osculating circles of a plane curve with monotonic curvature are pairwise disjoint and nested. We discuss this theorem and a number of its variations.

We use grid diagrams to investigate the Ozsvath-Szabo concordance invariant tau, and to prove that |tau(K_1)-tau(K_2)|<=g, whenever there is a genus g knot cobordism joining K_1 to K_2. This leads to an entirely grid diagram-based proof of…

We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is…

Decomposing knots and links into tangles is a useful technique for understanding their properties. The notion of prime tangles was introduced by Kirby and Lickorish in [3]; Lickorish proved [5] that by summing prime tangles one obtains a…