On Obstacle Numbers
Abstract
The obstacle number is a new graph parameter introduced by Alpert, Koch, and Laison (2010). Mukkamala etal (2012) show that there exist graphs with n vertices having obstacle number in Omega(n/ n). In this note, we up this lower bound to Omega(n/( n)2. Our proof makes use of an upper bound of Mukkamala etal on the number of graphs having obstacle number at most h in such a way that any subsequent improvements to their upper bound will improve our lower bound.
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.