Bisimplicial vertices and protected elimination in even-hole-free graphs
Statement
Conjecture 4 (Hayward and Reed). An even-hole-free graph contains a vertex whose neighbourhood can be partitioned into two 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.