ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ≤k\Gamma_{\leq k} denote the class of simple graphs with algebraic co-rank at most kk, and let Forb(Γ≤k){\bf Forb}(\Gamma_{\leq k}) be the set of graphs that do not contain a graph in Γ≤k\Gamma_{\leq k} as an induced subgraph. Finiteness conjecture. For all k∈Nk\in\mathbb{N}, the set

Forb(Γ≤k){\bf Forb}(\Gamma_{\leq k})

is finite. The paper establishes that this set is nonempty for every k≥0k\geq 0 and notes that the case k=3k=3 has been shown to contain 4949 graphs; finiteness for all kk 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 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.