arXiv subjects

Thomas W Mattman

Publications and source records attributed to Thomas W Mattman.

3 recordsLinked to original sources

arXiv2026

Three thousand obstructions to knotless embedding

We present a list of 3028 obstructions to knotless embedding. We survey recent work in this area including: 1) A bibliography of graphs proven to be intrinsically knotted without relying on computers; 2) An updated listing of obstructions in $\nabla\mathrm{Y}$ families including two new large families; 3) Connections with the Colin de Verdière's invariant including a new obstruction with $μ= 6$; and 4) Connectivity of obstructions and their structure near vertices of degree three or four. We address questions raised in earlier work, (re)state several conjectures, and propose new questions.

math.GT↗

arXiv2022

Bipartite intrinsically knotted graphs with 23 edges

A graph is intrinsically knotted if every embedding contains a nontrivially knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that there are exactly 14 intrinsically knotted graphs with 21 edges, in which the Heawood graph is the only bipartite graph. The authors showed that there are exactly two graphs with at most 22 edges that are minor minimal bipartite intrinsically knotted: the Heawood graph and Cousin 110 of the $E_9+e$ family. In this paper we show that there are exactly six bipartite intrinsically knotted graphs with 23 edges so that every vertex has degree 3 or more. Four among them contain the Heawood graph and the other two contain Cousin 110 of the $E_9+e$ family. Consequently, there is no minor minimal intrinsically knotted graph with 23 edges that is bipartite.

math.CO↗

arXiv2008

A sufficient condition for intrinsic knotting of bipartite graphs

We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six vertices in one part. We also show that there is a constant C_n such that a bipartite graph with exactly n \geq 5 vertices in one part and |E(G)| \geq 4 |V(G)| + C_n is intrinsically knotted. Finally, we classify bipartite graphs with ten or fewer vertices with respect to intrinsic knotting.

math.GT↗