
doi: 10.37236/761
Let $T$ be a unit equilateral triangle, and $T_1,\dots,T_n$ be $n$ equilateral triangles that cover $T$ and satisfy the following two conditions: (i) $T_i$ has side length $t_i$ ($0 < t_i < 1$); (ii) $T_i$ is placed with each side parallel to a side of $T$. We prove a conjecture of Zhang and Fan asserting that any covering that meets the above two conditions (i) and (ii) satisfies $\sum_{i=1}^n t_i \geq 2$. We also show that this bound cannot be improved.
Packing and covering in \(2\) dimensions (aspects of discrete geometry)
Packing and covering in \(2\) dimensions (aspects of discrete geometry)
| 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). | 3 | |
| 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 |
