ProbXiv
Explorersign in
Problem archiveProblem record

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.