Large simplices determined by finite point sets

DOI10.1007/s13366-012-0126-2zbMath1267.52015OpenAlexW2012097136MaRDI QIDQ1943341

Filip Morić, János Pach

Publication date: 19 March 2013

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13366-012-0126-2

zbMATH Keywords

distance graphsdiameter graphsnumber of cliqueslarge distancesregular simplices

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (2)

Remarks on Schur's conjecture ⋮ Proof of Schur's conjecture in \(\mathbb R^D\)

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on the theme of repeated distances
• On the graph of large distances
• A new proof of Vázsonyi's conjecture
• Unit distances and diameters in Euclidean spaces
• On large distances in planar sets
• Repeated distances in space
• The two largest distances in finite planar sets
• Counting Large Distances in Convex Polygons: A Computational Approach
• A counterexample to Borsuk’s conjecture
• Research Problems in Discrete Geometry
• On Sets of Distances of n Points

This page was built for publication: Large simplices determined by finite point sets