Triangle dissection, no shared edges It's possible to divide a triangle into smaller triangles such that no edge lengths are shared.  Alternately, no two internal triangles share two vertices. The top three are the known simplest solutions. The bottom three were found via doodling.



The triangles in the first solution could be subdivided the same way, so another criteria is added: no subdivided internal triangles are allowed. 

What are some other solutions with 7 to 18 internal triangles?

EDIT. Of the prime 7 dissections, and the prime-8, no new solutions are found.

New solutions might be found by analyzing Schlegel diagrams of planar graphs, and picking three vertices of each face to be a triangle. If no two triangles share two faces, and if excised facial vertices can be moved between triangular vertices, then it's a potential solution. For example, this graph leads to the upper right solution, with triangles 234, 478, 456, 138, 125, 167.



One more solution, with nine of the triangles having area 1.
If you have an equilateral triangle in the solution, you may just copy into it any of the other solutions thus having number of solutions as you desire.
If you have an equilateral triangle in the solution, you may just copy into it any of the other solutions thus having number of solutions as you desire.