The generalized Turán additive-approximation hardness conjecture
Statement
Let be a graph, let be a family of graphs such that no is a subgraph of a blow-up of , and let . For a graph on vertices, write for the maximum number of copies of in an -free subgraph of . Additive-approximation hardness conjecture. It is NP-hard to approximate up to additive error , where denotes the number of vertices of . This conjecture excludes the cases in which some forbidden graph is a subgraph of a blow-up of , for which a polynomial-time approximation with smaller additive error is available. The stated hardness is proved in the special case and when ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.