Skip to main content
Log in

Unit Distance Graphs and Algebraic Integers

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

We answer a question of Brass about vertex degrees in unit distance graphs of finitely generated additive subgroups of \(\mathbb {R}^2\).

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Brass, P.: Erdős distance problems in normed spaces. Comput. Geom. 6(4), 195–214 (1996)

    Article  MathSciNet  Google Scholar 

  2. Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Salem, R.: Algebraic Numbers and Fourier Analysis. D. C. Heath and Co., Boston (1963)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Danylo Radchenko.

Additional information

Editor in Charge: Kenneth Clarkson

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Radchenko, D. Unit Distance Graphs and Algebraic Integers. Discrete Comput Geom 66, 269–272 (2021). https://doi.org/10.1007/s00454-019-00152-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-019-00152-4

Keywords

Mathematics Subject Classification

Navigation