Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles

Details Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles

2007-06-06

arxiv.org/abs/0706.0801v3

Mathematics

Combinatorics

Scientific paper

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in certain arrangements of pseudocircles in the plane. In particular, forbidding certain subarrangements we improve the known bound of 6n-12 (cf. Kedem et al., 1986) for vertices of weight 0 in arrangements of n pseudocircles to 4n-6. In complete arrangements (i.e. arrangements with each two pseudocircles intersecting) we identify two subarrangements of three and four pseudocircles, respectively, whose absence gives improved bounds for vertices of weight 0 and more generally for vertices of weight <=k.

Affiliated with

Also associated with

No associations

Rating

Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles 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 Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-356817