Construction of locally plane graphs with many edges

Details Construction of locally plane graphs with many edges Construction of locally plane graphs with many edges

2011-10-28

arxiv.org/abs/1110.6482v1

Mathematics

Combinatorics

26 pages, 1 figure

Scientific paper

A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction of $k$-locally plane graphs with a super-linear number of edges. For the proof we develop randomized thinning procedures for edge-colored bipartite (abstract) graphs that can be applied to other problems as well.

Affiliated with

Also associated with

No associations

Rating

Construction of locally plane graphs with many edges 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 Construction of locally plane graphs with many edges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of locally plane graphs with many edges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200095