Biclique version of the Scott–Seymour conjecture
Statement
For positive integers and , let denote the complete bipartite graph with parts of size . A -wheel is a graph consisting of an induced cycle of length at least and one additional vertex with at least neighbours on the cycle. Biclique conjecture. For every pair of positive integers , the class of graphs with no induced -wheel and no induced is -bounded. The source presents this as a further expected strengthening; no resolution is given.
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.