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

Simple item page
dc.creatorOrtner, Ronald
dc.date2007-06-06
dc.date2008-06-13
dc.date.accessioned2026-07-07T09:44:03Z
dc.date.available2026-07-07T09:44:03Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0706.0801
dc.identifierhttp://arxiv.org/abs/0706.0801
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162735
dc.subjectCombinatorics
dc.subjectGeometric Topology
dc.subject52C35;05A99
dc.titleUpper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles
dc.typetext

Files

Collections

arXiv