ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c2(G)c_2(G) denote the minimum cardinality of a subgraph complementation system for a graph GG, and fix a natural number kk. A minimal forbidden induced subgraph for the property c2(G)≤kc_2(G)\leq k is a graph FF such that c2(F)>kc_2(F)>k but every proper induced subgraph F−vF-v satisfies c2(F−v)≤kc_2(F-v)\leq k. Vertex bound conjecture. Every minimal forbidden induced subgraph for the property c2(G)≤kc_2(G)\leq k has at most 2k+22k+2 vertices.

The preceding theorem establishes that the class of graphs with c2(G)≤kc_2(G)\leq k is characterized by finitely many forbidden induced subgraphs, but does not give an explicit bound on their orders. This conjecture proposes a linear bound based on results concerning linear forests.

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.