
Let S be a square of side length s > 0. We construct, for any sufficiently large s, a set of less than 1.994 s closed unit squares whose sides are parallel to those of S such that any straight line intersecting S intersects at least one square of S. It disproves L. Fejes Tòth's conjecture that, for integral s, there is no such configuration of less than 2s -1 unit squares.
discrete geometry, geometrical construction, Article, Erdős problems and related topics of discrete geometry, 510.mathematics, intersecting problem, line cover, minimal problem, 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung; Informatik, squares
discrete geometry, geometrical construction, Article, Erdős problems and related topics of discrete geometry, 510.mathematics, intersecting problem, line cover, minimal problem, 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung; Informatik, squares
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
