Skip to main content

Saturated Simple and 2-simple Topological Graphs with Few Edges

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9224))

Included in the following conference series:

  • 619 Accesses

Abstract

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at most k common points of this kind. We construct saturated simple and 2-simple graphs with few edges. These are k-simple graphs in which no further edge can be added. We improve the previous upper bounds of Kynčl, Pach, Radoičić, and Tóth [Comput. Geom., 48, 2015] and show that there are saturated simple graphs on n vertices with only 7n edges and saturated 2-simple graphs on n vertices with 14.5n edges. As a consequence, 14.5n edges is also a new upper bound for k-simple graphs (considering all values of k). We also construct saturated simple and 2-simple graphs that have some vertices with low degree.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Erdős, P., Hajnal, A., Moon, J.W.: A problem in graph theory. Amer. Math. Monthly 71, 1107–1110 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  2. Faudree, J.R., Faudree, R.J., Schmitt, J.R.: A survey of minimum saturated graphs. Electron. J. Combin. 18, #DS19 (2011)

    MATH  Google Scholar 

  3. Hajnal, P., Igamberdiev, A., Rote, G., Schulz, A.: Saturated simple and 2-simple topological graphs with few edges (2015). http://arxiv.org/abs/1503.01386

  4. Kászonyi, L., Tuza, Z.: Saturated graphs with minimal number of edges. J. Graph Theor. 10(2), 203–210 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kynčl, J., Pach, J., Radoičić, R., Tóth, G.: Saturated simple and \(k\)-simple topological graphs. Comput. Geom. 48(4), 295–310 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lovász, L.: Three short proofs in graph theory. J. Comb. Theor. Ser. B 19(3), 269–271 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The first author thanks Géza Tóth for presenting their inspiring results [5] in Szeged and for the encouragement during his investigation. This research was partially initiated at the EuroGIGA Workshop on Geometric Graphs in Münster, Germany, 2014, supported by the European Science Foundation (ESF).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to André Schulz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hajnal, P., Igamberdiev, A., Rote, G., Schulz, A. (2016). Saturated Simple and 2-simple Topological Graphs with Few Edges. In: Mayr, E. (eds) Graph-Theoretic Concepts in Computer Science. WG 2015. Lecture Notes in Computer Science(), vol 9224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53174-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-53174-7_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-53173-0

  • Online ISBN: 978-3-662-53174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics