MathNet 2016-part-01 — 184 problems (EN–VI) Question 136

Given a graph with $n$ ($n \ge 4$) vertices. It is known that for any two of the vertices there is a vertex connected with none of these two vertices.
Find the greatest possible number of the edges in the graph.
(E. Barabanov)