Problem

Source: 2019 China TST Test 4 P2

Tags: graph theory, combinatorics



A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$, $|E|>2018$, find the minimum of $|E|$ .