Lower bounds on the obstacle number of graphs

Details Lower bounds on the obstacle number of graphs Lower bounds on the obstacle number of graphs

2011-03-14

arxiv.org/abs/1103.2724v1

Mathematics

Combinatorics

Scientific paper

Given a graph $G$, an {\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The {\em obstacle number} of $G$ is the minimum number of obstacles in an obstacle representation of $G$. It is shown that there are graphs on $n$ vertices with obstacle number at least $\Omega({n}/{\log n})$.

Affiliated with

Also associated with

No associations

Rating

Lower bounds on the obstacle number of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower bounds on the obstacle number of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds on the obstacle number of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260433