Search

We consider a simple but infinite class of staked links known as bongles. We provide necessary and sufficient conditions for these bongles to be hyperbolic. Then, we prove that all balanced hyperbolic $n$-bongles have the same volume and the corresponding volume is an upper bound on the volume of any hyperbolic $n$-bongle for $n$ even. Moreover, all hyperbolic $n$-bongles have volume strictly less than $5n(1.01494\dots)$. We also include explicit volume calculations for all hyperbolic 3-bongles through 6-bongles., Comment: 16 pages, 11 figures

We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination numbers of a graph and its complement. We provide an answer to an open question about the minimal order of a 3-non-compliant graph. We prove that the complements of knotlessly embeddable graphs of order at least 15 are all intrinsically knotted. We provide results on general $k$-non-compliant graphs and leave a set of open questions for further exploration of the subject., Comment: 18 pages, 10 figures

We prove that the complement of any non-separating planar graph of order $2n-3$ contains a $K_n$ minor, and argue that the order $2n-3$ is lowest possible with this property. To illustrate the necessity of the non-separating hypothesis, we give an example of a planar graph of order 11 whose complement does not contain a $K_7$ minor. We argue that the complements of planar graphs of order 11 are intrinsically knotted. We compute the Hadwiger numbers of complements of wheel graphs., Comment: 13 pages, 8 figures