Discrete & Computational Geometry

, Volume 56, Issue 3, pp 814–832 | Cite as

Turán Type Results for Distance Graphs

  • Lev E. Shabanov
  • Andrei M. RaigorodskiiEmail author


The classical Turán theorem determines the minimum number of edges in a graph on n vertices with independence number \(\alpha \). We consider unit-distance graphs on the Euclidean plane, i.e., graphs \( G = (V,E) \) with \( V \subset {\mathbb {R}}^2 \) and \( E = \{\{\mathbf{x}, \mathbf{y}\}: |\mathbf{x}-\mathbf{y}| = 1\} \), and show that the minimum number of edges in a unit-distance graph on n vertices with independence number \( \alpha \leqslant \lambda n \), \( \lambda \in [\frac{1}{4}, \frac{2}{7}] \), is bounded from below by the quantity \( \frac{19 - 50 \lambda }{3} n \), which is several times larger than the general Turán bound and is tight at least for \( \lambda = \frac{2}{7} \).


Turán theorem Independence number Distance graphs 

Mathematics Subject Classification

05C35 52C10 



This work is done under the financial support of the following grants: the Grant 15-01-00350 of Russian Foundation for Basic Research, the Grant NSh-2964.2014.1 supporting leading scientific schools of Russia.


  1. 1.
    Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)zbMATHGoogle Scholar
  2. 2.
    Croft, H.T.: Incident incidents. Eureka 30, 22–26 (1967)Google Scholar
  3. 3.
    Erdős, P.: On sets of distances of \(n\) points. Am. Math. Mon. 53, 248–250 (1946)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Fajtlowicz, S.: Independence, clique size and maximum degree. Combinatorica 4(N1), 35–38 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fraughnaugh, K.L., Locke, S.: \(11/30\) finding large independent sets in connected triangle-free 3-regular graphs. J. Comb. Theory 65(N1), 51–72 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Fraughnaugh, K.L., Locke, S.: Finding independent sets in triangle-free graphs. SIAM J. Discrete Math. 9(N4), 674–681 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Fraughnaugh, K.L., Locke, S.: Lower bounds on size and independence in \(K_4\)-free graphs. J. Graph Theory 26(N2), 61–71 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kokotkin, A.A.: On large subgraphs of a distance graph which have small chromatic number. Math. Notes 96(N2), 298–300 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Larman, D.G., Rogers, C.A.: The realization of distances within sets in Euclidean space. Mathematika 19, 1–24 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Locke, S., Lou, F.: Finding independent sets in \(K_{4}\)-free 4-regular connected graphs. J. Comb. Theory, Ser. B 71, N1 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Raigorodskii, A.M.: Coloring distance graphs and graphs of diameters. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 429–460. Springer, New York (2013)Google Scholar
  12. 12.
    Raigorodskii, A.M.: Cliques and cycles in distance graphs and graphs of diameters. Discrete Geom. Algebr. Comb. AMS Contemp. Math. 625, 93–109 (2014)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Turán, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (1941) (in Hungarian)Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Mathematics FacultyHigher School of EconomicsMoscowRussia
  2. 2.Department of Mathematical Statistics and Random Processes, Mechanics and Mathematics FacultyMoscow State UniversityMoscowRussia
  3. 3.Department of Discrete Mathematics and Laboratory of Advanced Combinatorics and Network Applications, Faculty of Innovations and High TechnologyMoscow Institute of Physics and TechnologyMoscowRussia
  4. 4.Institute of Mathematics and InformaticsBuryat State UniversityUlan-UdeRussia

Personalised recommendations