The obstruction set for graphs with knotless embeddings is not known, but a recent
paper of Goldberg, Mattman, and Naimi indicates that it is quite large. Almost all
known obstructions fall into four triangle-Y families and they ask if there is an
efficient way of finding or estimating the size of such graph families. Inspired by this
question, we investigate the family size for complete multipartite graphs. Aside from
three families that appear to grow exponentially, these families stabilize: after a
certain point, increasing the number of vertices in a fixed part does not change family
size.
PDF Access Denied
We have not been able to recognize your IP address
18.97.9.170
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.