Vida Dujmović, Pat Morin
Published 2013-08-20Version 1
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/\log n). In this note, we up this lower bound to Omega(n/(\log\log 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.
An upper bound for the $k$-power domination number in $r$-uniform hypergraphs
A Lower Bound on the Crossing Number of Uniform Hypergraphs
Flips in Graphs
![QR code for arXiv:1308.4321 [math.CO]](http://oss.arxitics.com/images/favicon.svg)