Wslkhawlkjfhqowdihfasldjkfhaklsjdfi9qweuhfn,asmdnozxiucNow, we repeat the process of adding

a vertex to our graph G4, and connecting it so that the new graph G5 contains the
maximum number of edges. This new graph G5 must contain three more edges than G4
according to our theorem. Just like in the previous case, the three new edges must be
connected to the new vertex, because if one were to add an edge between any of the old
vertices that would imply the previous graph G4 did not contain the maximum number of
edges which results in a contradiction.