Independence complexes and edge covering complexes via Alexander duality.
Independent face and vertex covers in plane graphs
Inductio ad absurdum?
Infinitely many hypermaps of a given type and genus.
Intersections of Curve Systems and the Crossing Number of C5 x C5 .
Interval edge-coloring of caterpillars with hairs of arbitrary length
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.
Isomorphisms of polar and polarized graphs