24 citations · 78 across the 21 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.GT2021★ 3 cited
Intrinsically knotted graphs with linklessly embeddable simple minors
Thomas W. Mattman, Ramin Naimi, Andrei Pavelescu +1
It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph. We present a new intrinsi…
math.GT2021
The Complement Problem for Linklessly Embeddable Graphs
Ramin Naimi, Ryan Odeneal, Andrei Pavelescu +1
We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph of order 11 either or its complement is intrinsically linked. We gi…