ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer n≥4n\ge 4, does there exist a finite simple graph GG such that GG has no induced subgraph isomorphic to CnC_n, but, for every pair of distinct vertices u,v∈V(G)u,v\in V(G), toggling the adjacency of uu and vv produces a graph containing an induced subgraph isomorphic to CnC_n? Equivalently, does an induced-saturated graph exist for every cycle CnC_n other than the triangle C3C_3?

Record

Added
Links

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.