For $\epsilon > 0$ sufficiently small, can a regular hexagon with sides of length $1 + \epsilon$ be covered by seven equilateral triangles with sides of length $1$?
Motivation: Conway and Soifer showed that an equilateral triangle with sides $n + \epsilon$ can be covered with $n^2 + 2$ triangles. They conjectured that this is best possible, i.e. that it can not be covered by $n^2 + 1$ such triangles. This is fairly clear for $n=1$ and $n=2$ but the problem seems to be open even for $n=3$. The hexagon I've asked about is a substructure of the $n=3$ case that might be more tractable, but might still capture some of the difficulties of the $n=3$ and larger cases.