6 citations · 16 across the 5 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
math.CO2006★ 2 cited
Counting Links in Complete Graphs
Tom Fleming, Blake Mellor
We find the minimal number of links in an embedding of any complete -partite graph on 7 vertices (including , which has at least 21 links). We give either exact values or u…
math.GT2006★ 1 cited
Intrinsic linking and knotting are arbitrarily complex
Erica Flapan, Blake Mellor, Ramin Naimi
We show that, given any and , every embedding of any sufficiently large complete graph in contains an oriented link with components , ..., such tha…
math.GT2006★ 6 cited
An Introduction to Virtual Spatial Graph Theory
Thomas Fleming, Blake Mellor
Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. Th…