Finiteness conjecture for forbidden graphs of bounded algebraic co-rank
Statement
Let denote the class of simple graphs with algebraic co-rank at most , and let be the set of graphs that do not contain a graph in as an induced subgraph. Finiteness conjecture. For all , the set
is finite. The paper establishes that this set is nonempty for every and notes that the case has been shown to contain graphs; finiteness for all remains conjectural.
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.