ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a set T\mathcal T of trees, a graph is (T∪{Kk})(\mathcal T\cup\{K_k\})-free if it contains no member of T\mathcal T and no copy of KkK_k as an induced subgraph. Sandwich-problem hardness conjecture. For every positive integer k≥4k\geq 4 and every possibly infinite set T\mathcal T of non-star trees, the sandwich problem for (T∪{Kk})(\mathcal T\cup\{K_k\})-free graphs is NP-hard. This claim is presented as a consequence of the Gyárfás–Sumner and Brakensiek–Guruswami conjectures, so its status is unresolved when those conjectures are unresolved.

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.