At least n - 1 intersection points in a connected family of n unit circles in the plane

DOI10.1007/S00454-007-1341-8MaRDI QIDQ2464365zbMATH OpenOpenAlexFDO

Authors Hagit Last, Rom Pinchasi

Publication date 19 December 2007

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-007-1341-8

zbMATH Keywords

circle arrangementscovering

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• n points in the plane can determine \(n^{3/2}\) unit circles
• On the number of circles determined by \(n\) points in the Euclidean plane
• Intersection graphs for families of balls in \(R^n\)
• On crossing-families in planar point sets
• On the number of circles determined byn points
• Families of paths in the plane that connect all point pairs
• Sets in a finite plane with few intersection numbers and a distinguished point
• On unit circles which avoid all but two points of a given point-set

Cited in

(4)

• Gallai-Sylvester theorem for pairwise intersecting unit circles
• A combinatorial distinction between unit circles and straight lines: how many coincidences can they have?
• scientific article; zbMATH DE number 1054776 (Why is no real title available?)
• Some notes about the odd area of unit discs centered at points on a circle

This page was built for publication: At least \(n - 1\) intersection points in a connected family of \(n\) unit circles in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464365)