Erdős Problem #81
Statement
Let be a chordal graph on vertices - that is, has no induced cycles of length greater than . Can the edges of be partitioned into many cliques?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.