Advertisement

Discrete & Computational Geometry

, Volume 11, Issue 2, pp 235–239 | Cite as

Unit squares intersecting all secants of a square

  • Pavel Valtr
Article

Abstract

LetS be a square of side lengths>0. We construct, for any sufficiently larges, a set of less than 1.994s closed unit squares whose sides are parallel to those ofS such that any straight line intersectingS intersects at least one square ofS. It disproves L. Fejes Tóth's conjecture that, for integrals, there is no such configuration of less than 2s−1 unit squares.

Keywords

Line Segment Side Length Discrete Comput Geom Line intersectingS Vertical Line Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [B] K. A. Brakke, The opaque cube problem,Amer. Math. Monthly 99 (9) (1992), 866–871.zbMATHMathSciNetCrossRefGoogle Scholar
  2. [BF] I. Bárány and Z. Füredi, Covering all secants of a square,Proceedings of the Colloquia Mathematica Societatis János Bolyai, Siofok, Hungary, 1985 (in honor of L. Fejes Tóth).Google Scholar
  3. [FT] L. Fejes Tóth, Remarks on dual of Tarski's plank problem,Mat. Lapok 25 (1974), 13–20.MathSciNetGoogle Scholar
  4. [KW] W. Kern and A. Wanka, On a problem about covering lines by squares,Discrete Comput. Geom. 5 (1990), 77–82.zbMATHMathSciNetCrossRefGoogle Scholar
  5. [MP] W. O. Moser and J. Pach, Research Problems in Discrete Geometry, Problem 84, Montréal 1985, mimeographed.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1994

Authors and Affiliations

  • Pavel Valtr
    • 1
    • 2
  1. 1.Department of Applied MathematicsCharles UniversityPraha 1Czech Republic
  2. 2.Graduiertenkolleg “Algorithmische Diskrete Mathematik”, Fachbereich MathematikFreie Universität BerlinBerlin 33Germany

Personalised recommendations