A Proof of a Conjecture of Ohba
Abstract
We prove a conjecture of Ohba which says that every graph G on at most 2(G)+1 vertices satisfies (G)=(G).
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.