
doi: 10.37236/1952
Packing and covering are elementary but very important in combinatorial geometry, they have great practical and theoretical significance. In this paper, we discuss a problem on packing and covering a unit equilateral triangle with smaller triangles which is originated from one of Erdős' favorite problems.
minimal covering, packing, Packing and covering in \(2\) dimensions (aspects of discrete geometry), Convex sets in \(2\) dimensions (including convex curves)
minimal covering, packing, Packing and covering in \(2\) dimensions (aspects of discrete geometry), Convex sets in \(2\) dimensions (including convex curves)
| 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 |
