Bisimplicial vertices in even-hole-free graphs
Statement
Every finite simple even-hole-free graph contains a bisimplicial vertex, where an even-hole-free graph has no induced cycle of even length at least four, and a vertex is bisimplicial if its set of neighbors induces a graph that is the union of two cliques.
Record
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.