ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α(G)\alpha(G) denote the stability number of a graph GG, let ω(G)\omega(G) denote its clique number, and call GG free of a family of graphs if it contains none of them as an induced subgraph. Consider the family consisting of the six-vertex bipartite graphs with a perfect matching and their complements. The bounded-deficiency conjecture. There exists a constant cc such that every graph GG free of this family satisfies

α(G)+ω(G)≥∣V(G)∣−c.\alpha(G)+\omega(G)\geq |V(G)|-c.

This conjecture asks whether excluding these natural obstructions forces the deficiency ∣V(G)∣−α(G)−ω(G)|V(G)|-\alpha(G)-\omega(G) to be bounded independently of GG; no resolution is given in the source.

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.