Existence of H-induced-saturated graphs for cycles
Statement
For each integer , does there exist a finite simple graph such that has no induced subgraph isomorphic to , but, for every pair of distinct vertices , toggling the adjacency of and produces a graph containing an induced subgraph isomorphic to ? Equivalently, does an induced-saturated graph exist for every cycle other than the triangle ?
Record
- Added
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.