benchmarks.wiki

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| .

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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| .
Plain-text mathematical notation (without MathML)
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| .
Original LaTeX notation
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

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
102538ce-6a80-5ee3-993b-b1d2ab4ea911
task_key
test--102538ce-6a80-5ee3-993b-b1d2ab4ea911
task_revision_id
1
config / split
/ test

Official source

initial import