On unit distances in a convex polygon

DOI10.1016/j.disc.2014.10.009zbMath1307.52008arXiv1009.2216OpenAlexW1843099971MaRDI QIDQ482205

Amol Aggarwal

Publication date: 19 December 2014

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

Full work available at URL: https://arxiv.org/abs/1009.2216

zbMATH Keywords

convex polygondistance matrix0-1 matrixdiagonal propertyobtuse angle propertyunit distance

Mathematics Subject Classification ID

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

Related Items (2)

Turán problems for edge-ordered graphs ⋮ Convexly independent subsets of Minkowski sums of convex polygons

Cites Work

• On linear forbidden submatrices
• A lower bound on the number of unit distances between the vertices of a convex polygon
• Unit distances between vertices of a convex polygon
• The maximum number of unit distances in a convex \(n\)-gon
• Forbidden paths and cycles in ordered graphs and matrices
• On 0-1 matrices and small excluded submatrices
• On Sets of Distances of n Points
• The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
• Unnamed Item
• Unnamed Item

This page was built for publication: On unit distances in a convex polygon