A 4-dimensional graph has at least 9 edges

The open problem posed by Paul Erdős asking for the smallest number of edges in a 4-dimensional graph is solved by showing that a 4-dimensional graph must have at least 9 edges. Furthermore, there is only one 4-dimensional graph with 9 edges, namely K 3 , 3 .