ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Induced packing and covering

Let HH be a fixed graph, GG an nn-vertex graph. If the minimum number of edges needed to add or remove from GG in order to remove all induced copies of HH is o(n2)o(n^2), then the regularity lemma implies that the maximum number of induced copies of HH, with each pair intersecting in at most one vertex, is o(n2)o(n^2).

Can we get better bounds, even for the case H=C5H=C_5?

Record

Added
Links

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.