The complement problem for linklessly embeddable graphs
The complement problem for linklessly embeddable graphs
We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph [Formula: see text] of order 11 either [Formula: see text] or its complement [Formula: see text] is intrinsically linked. We give an example of a graph [Formula: see text] of order 11 …