Congratulations to Jed of the 3rd grade and John L. and Olivia R. of the 4th grade for finding a way to construct a K6 graph with only three cross-overs. This, in fact, is the minimum number of edge crossings in this graph.