ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs, and let RemH(G)\mathrm{Rem}_H(G) denote the maximum number of edges in an HH-free spanning subgraph of GG. A graph HH is a star forest if every connected component of HH is a star. Alon–Shapira–Sudakov conjecture. Computing RemH(G)\mathrm{Rem}_H(G) is NP-hard if and only if HH 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 HH.

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.