The bounded-deficiency conjecture for graphs excluding six-vertex bipartite graphs
Statement
Let denote the stability number of a graph , let denote its clique number, and call 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 such that every graph free of this family satisfies
This conjecture asks whether excluding these natural obstructions forces the deficiency to be bounded independently of ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.