Let P be a set of n points in the plane. A topological hypergraphG, on the set of points of P, is a collection of simple closed curves in the plane that avoid the points of P. Each of these curves is called an edge of G, and the points of P are called the vertices of G. We provide bounds on the number of edges of topological hypergraphs in terms of the number of their vertices under various restrictions assuming the set of edges is a family of pseudo-circles.
CITATION STYLE
Buzaglo, S., Pinchasi, R., & Rote, G. (2013). Topological hypergraphs. In Thirty Essays on Geometric Graph Theory (Vol. 9781461401100, pp. 71–81). Springer New York. https://doi.org/10.1007/978-1-4614-0110-0_6
Mendeley helps you to discover research relevant for your work.