The strong normal graph characterization conjecture
Statement
Let be a graph. A graph is strongly normal if every induced subgraph of is normal; let denote the complement of , and let denote the cycle on vertices. The strong normal graph characterization conjecture. A graph is strongly normal if and only if neither nor contains a or a as an induced subgraph. This is presented as a restatement of the Normal Graph Conjecture, so it is refuted along with that conjecture.
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.