Pith sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1304.2020 v1 pith:U7IMYKCE submitted 2013-04-07 math.MG

Paths on the Doubly Covered Region of a Covering of the Plane by Unit Discs

classification math.MG
keywords covereddoublyregioncoveringdiscslengthmathcalpath
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Given a covering of the plane by closed unit discs $\mathcal F$ and two points $A$ and $B$ in the region doubly covered by $\mathcal F$, what is the length of the shortest path connecting them that stays within the doubly covered region? This is a problem of G. Fejes-T\'oth and he conjectured that if the distance between $A$ and $B$ is $d$, then the length of this path is at most $\sqrt 2 d+O(1)$. In this paper we give a bound of $2.78 d+O(1)$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.