Skip to main content

Topological Hypergraphs

  • Chapter
  • First Online:
Thirty Essays on Geometric Graph Theory

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. P. Agarwal, E. Nevo, J. Pach, R. Pinchasi, M. Sharir, S. Smorodinsky, Lenses in arrangements of pseudocircles and their applications. J. ACM 51, 139–186 (2004)

    Article  MathSciNet  Google Scholar 

  2. Ch. Chojnacki (A. Hanani), Über wesentlich unplättbare Kurven im dreidimensionalen Raume. Fund. Math. 23, 135–142 (1934)

    Google Scholar 

  3. E. Helly, Über Systeme abgeschlossener Mengen mit gemeinschaftlichen Punkten. Monatshefte Mathematik 37, 281–302 (1930)

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Hall, On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935)

    Google Scholar 

  5. J. Molnár, Über eine verallgemeinerung auf die kugelfläche eines topologischen satzes von Helly. Acta Math. Acad. Sci. 7, 107–108 (1956)

    Article  MATH  Google Scholar 

  6. J. Pach, G. Tóth, Disjoint edges in topological graphs, in Combinatorial Geometry and Graph Theory. Lecture Notes in Computer Science, vol. 3330 (Springer, Berlin, 2005), pp. 133–140

    Google Scholar 

  7. N. Sauer, On the density of families of sets. J. Comb. Theor. Ser. A 25, 80–83 (1972)

    Google Scholar 

  8. S. Shelah, A combinatorial problem, stability and order for models and theories in infinite languages. Pacific J. Math. 41, 247–261 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  9. W.T. Tutte, Toward a theory of crossing numbers. J. Comb. Theor. 8, 45–53 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  10. V.N. Vapnik, A.a. Chervonenkis, On the uniform convergence of relative frequences of events to their probabilities. Theor. Prob. Appl. 16, 264–280 (1971)

    Google Scholar 

Download references

Acknowledgements

We thank Eyal Ackerman, Kevin Buchin, and Christian Knauer for very helpful discussions We are grateful to Andrea Munaro for pointing out the correct formulation of Lemmma 3. Research by Sarit Buzaglo and Rom Pinchasi was supported by the Israeli Science Foundation (grant no. 938/06).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rom Pinchasi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Buzaglo, S., Pinchasi, R., Rote, G. (2013). Topological Hypergraphs. In: Pach, J. (eds) Thirty Essays on Geometric Graph Theory. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0110-0_6

Download citation

Publish with us

Policies and ethics