NP-hardness conjecture for sandwich problems with forbidden trees and cliques
Statement
For a set of trees, a graph is -free if it contains no member of and no copy of as an induced subgraph. Sandwich-problem hardness conjecture. For every positive integer and every possibly infinite set of non-star trees, the sandwich problem for -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.