24 citations · 78 across the 21 of their papers we have counts for
18 papers · 1 filter
A Gap in Stanfield's Proof of Sachs' Linear Linkless Embedding Conjecture
Ramin Naimi
This is a short note describing what I believe is a serious gap in Stanfield's proof of Sachs' conjecture that every linklessly embeddable graph has a linear linkless embedding in…
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…
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…
New bounds on maximal linkless graphs
Ramin Naimi, Andrei Pavelescu, Elena Pavelescu
We construct a family of maximal linklessly embeddable graphs on vertices and edges for all , and another family on vertices and $m< \frac{25n}{12}-\frac{1}…
On intrinsically knotted and linked graphs
Ramin Naimi
We give a brief survey of some known results on intrinsically linked or knotted graphs.
Intrinsic linking and knotting are arbitrarily complex in directed graphs
Thomas W. Mattman, Ramin Naimi, Benjamin Pagano
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a -component link, and left open the possibility that a directed graph with an intrin…