# So much for scientific visualisation

An undirected graph without self-loops and without multiple edges contains a triangle if it has 4 vertices and 5 edges. the simplest proof observes that the graph in question is the complete 4-graph from which 1 edge has been removed: any triple vertices that does not contain both endpoints of the removed edge yields a triangle. If you insist on making a picture, you may consider