MathDB
Triangle-free graph with least edges

Source: 2019 China TST Test 4 P2

March 29, 2019
graph theorycombinatorics

Problem Statement

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