Popular distances in 3-space

DOI10.1016/S0012-365X(98)00328-8zbMath0957.52006OpenAlexW2156013034WikidataQ105889015 ScholiaQ105889015MaRDI QIDQ1301635

Gergely Harcos, János Pach

Publication date: 20 December 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00328-8

zbMATH Keywords

directed graphextremal problemsErdős problemssets of distances of \(n\) points

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Variations on the theme of repeated distances
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Combinatorial complexity bounds for arrangements of curves and spheres
• Repeated distances in space
• On a problem of K. Zarankiewicz
• On Sets of Distances of n Points

This page was built for publication: Popular distances in 3-space