activity
19992005
most citedIntrinsic knotting and linking of almost complete partite graphs

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2004Show all

2 papers · 1 filter

math.GT2004

Ribbonlength of torus knots

Brooke Brennan, Thomas W. Mattman, Roberto Raya +1

Using Kauffman's model of flat knotted ribbons, we demonstrate how all regular polygons of at least seven sides can be realised by ribbon constructions of torus knots. We calculate…

math.GT2004

Bounds on the Crosscap Number of Torus Knots

Thomas W. Mattman, Owen Sizemore

For a torus knot K, we bound the crosscap number c(K) in terms of the genus g(K) and crossing number n(K): c(K) \leq [(g(K)+9)/6] and c(K) \leq [(n(K) + 16)/12]. The (6n-2,3) torus…