Erdős Problem #167 — Covering triangles by twice their packing number
Statement
If a graph contains at most pairwise edge-disjoint triangles, can all triangles of be destroyed by deleting at most edges?
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.