Ramin Naimi

activity

20062026

most citedMany, many more intrinsically knotted graphs

24 citations · 78 across the 21 of their papers we have counts for

collaborators

Showing 2020 · math.GTShow all

2 papers · 2 filters

math.GT2020★ 4 cited

New bounds on maximal linkless graphs

Ramin Naimi, Andrei Pavelescu, Elena Pavelescu

We construct a family of maximal linklessly embeddable graphs on $n$ vertices and $3 n - 5$ edges for all $n \geq 10$ , and another family on $n$ vertices and $m< \frac{25n}{12}-\frac{1}…

math.GT2020

On intrinsically knotted and linked graphs

Ramin Naimi

We give a brief survey of some known results on intrinsically linked or knotted graphs.