ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A graph is strongly normal if every induced subgraph of GG is normal; let G‾\overline{G} denote the complement of GG, and let CkC_k denote the cycle on kk vertices. The strong normal graph characterization conjecture. A graph GG is strongly normal if and only if neither GG nor G‾\overline{G} contains a C5C_5 or a C7C_7 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 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.