Independence complexes of stable Kneser graphs.
Intrinsic knotting and linking of complete graphs.
Intrinsic linking and knotting are arbitrarily complex
We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, and , where denotes the second coefficient of the Conway polynomial of .
Intrinsically linked graphs and even linking number.