ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a graph, let F\mathcal{F} be a family of graphs such that no F∈FF\in\mathcal{F} is a subgraph of a blow-up of TT, and let ϵ>0\epsilon>0. For a graph GG on nn vertices, write ex(G,T,F)\mathrm{ex}(G,T,\mathcal{F}) for the maximum number of copies of TT in an F\mathcal{F}-free subgraph of GG. Additive-approximation hardness conjecture. It is NP-hard to approximate ex(G,T,F)\mathrm{ex}(G,T,\mathcal{F}) up to additive error nv(T)−ϵn^{v(T)-\epsilon}, where v(T)v(T) denotes the number of vertices of TT. This conjecture excludes the cases in which some forbidden graph is a subgraph of a blow-up of TT, for which a polynomial-time approximation with smaller additive error is available. The stated hardness is proved in the special case T=KmT=K_m and F={Kk}\mathcal{F}=\{K_k\} when k≥m+2k\geq m+2; the general claim remains open.

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.