Alon–Shapira–Sudakov conjecture on the complexity of graph removal
Statement
Let and be graphs, and let denote the maximum number of edges in an -free spanning subgraph of . A graph is a star forest if every connected component of is a star. Alon–Shapira–Sudakov conjecture. Computing is NP-hard if and only if is not a star forest. The theorem preceding this conjecture establishes the corresponding classification for forests; the conjecture asks whether the same dichotomy holds for all graphs .
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.