Erdős’s Unit Distance Problem

DOI10.1007/978-3-319-32162-2_15zbMath1354.52019OpenAlexW2486182446MaRDI QIDQ2827300

No author found.

Publication date: 18 October 2016

Published in: Open Problems in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32162-2_15

zbMATH Keywords

geometric graphsunit distancesextremal graph theoryforbidden subgraphincidences

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37)

Related Items (2)

Additive structure in convex translates ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

This page was built for publication: Erdős’s Unit Distance Problem