The even-order non-separable subgraph conjecture
Statement
Let be a non-separable graph of even order, meaning that no subset of its vertices with becomes disconnected from its complement after any switching. A subgraph obtained by removing one vertex is an induced subgraph, as only induced subgraphs are considered. Even-order non-separable subgraph conjecture. From every non-separable graph of even order one can obtain a non-separable subgraph by removing one vertex. The question concerns the even-order counterpart to the known odd-order examples: for every odd , there is a non-separable graph of order whose subgraphs of order are all separable, while exhaustive searches found no analogous examples of orders or .
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.