I have been working on this problem for quite a while and it seems necessary to prove or disprove this particular problem.
Suppose $T$ is the set of all possible triangles made from the vertices of a given convex polygon $A$.
If $A$ has 3 to 4 vertices, the smallest triangle in $T$ will always be made from three adjacent vertices.
Is true for all convex polygons? If not, what can we state about the minimum triangle?