The complement of a nIL graph with thirteen vertices is IL
Abstract
We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.