# Disjoint Edges in Geometric Graphs

• Original Paper
• Published:

## Abstract

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the convex hull of its neighbours. We show that for a geometric graph with $$n$$ vertices and $$e$$ edges there are at least $$\frac{n}{2}\left(\begin{array}{cc}2e/n\\3\end{array}\right)$$ pairs of disjoint edges provided that $$2e\ge n$$ and all the vertices of the graph are pointed. Besides, we prove that if any edge of a geometric graph with $$n$$ vertices is disjoint from at most $$m$$ edges, then the number of edges of this graph does not exceed $$n(\sqrt{1+8m}+3)/4$$ provided that $$n$$ is sufficiently large. These two results are tight for an infinite family of graphs.

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

## Subscribe and save

Springer+ Basic
\$34.99 /Month
• Get 10 units per month
• 1 Unit = 1 Article or 1 Chapter
• Cancel anytime

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

## References

1. Alon, N., Erdös, P.: Disjoint edges in geometric graphs. Discrete Comput. Geometry 4(4), 287–290 (1989)

2. Avital, S., Hanani, H.: Graphs. Gilyonot Lematematika 3(2), 2–8 (1966)

3. Erdös, P.: On sets of distances of n points. Am. Math. Mon. 53(5), 248–250 (1946)

4. Felsner, S.: Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry. Springer Science & Business Media, New York (2012)

5. Goddard, W., Katchalski, M., Kleitman, D.J.: Forcing disjoint segments in the plane. Eur. J. Comb. 17(4), 391–395 (1996)

6. Hopf, H., Pannwitz, E.: Aufgabe nr. 167. Jahresbericht d. Deutsch. Math.-Verein. 43, 114 (1934)

7. Keller, C., Perles, M.A.: On the smallest sets blocking simple perfect matchings in a convex geometric graph. Israel J. Math. 187(1), 465–484 (2012)

8. Kupitz, Y.S.: Extremal Problems in Combinatorial Geometry, 53rd edn. Aarhus universitet, Matematisk institut (1979)

9. Mészáros, Z.: Geometrické grafy, Diploma work. Charles University, Prague (1998).. ((in Czech))

10. Pach, J.: The Beginnings of Geometric Graph Theory, Erdős Centennial, pp. 465–484. Springer, New York (2013)

11. Pach, J., Törőcsik, J.: Some geometric applications of dilworth’s theorem. Discrete Comput. Geometry 12(1), 1–7 (1994)

12. Tóth, G.: Note on geometric graphs. J. Combin. Theory Ser. A 89(1), 126–132 (2000)

13. Tóth, G., Valtr, P.: Geometric graphs with few disjoint edges. Discrete Comput. Geometry 22(4), 633–642 (1999)

14. Černý, J.: Geometric graphs with no three disjoint edges. Discrete Comput. Geometry 34(4), 679–695 (2005)

## Funding

The study of the second author was funded by Russian Science Foundation (Grant no. 21-71-10092). The second author is a Young Russian Mathematics award winner and would like to thank its sponsors and jury.

## Author information

Authors

### Corresponding author

Correspondence to Alexandr Polyanskii.

## Ethics declarations

### Conflict of interest

The authors declare that they have no conflict of interest.

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

Chernega, N., Polyanskii, A. & Sadykov, R. Disjoint Edges in Geometric Graphs. Graphs and Combinatorics 38, 162 (2022). https://doi.org/10.1007/s00373-022-02563-2

• Revised:

• Accepted:

• Published:

• DOI: https://doi.org/10.1007/s00373-022-02563-2