Today, I have thought about this problem with two other people, and we proved that every minimal tree is essentially three paths meeting at a vertex. From this, we can easily deduce that this $E_7$ is the unique minimal element. Let me try to post our proof in a few days (I think it will be about 2 pages long.) I will delete this after I post the proof.
Ilhee Kim
- 248
- 1
- 8