Induced packing versus dynamic editing for C5
Statement
Induced packing and covering
Let be a fixed graph, an -vertex graph. If the minimum number of edges needed to add or remove from in order to remove all induced copies of is , then the regularity lemma implies that the maximum number of induced copies of , with each pair intersecting in at most one vertex, is .
Can we get better bounds, even for the case ?
Record
- Source
- Added
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.