benchmarks.wiki / Public workspace

Omni-MATH / 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| . · Discussion

Discussing 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| . · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.