McDonald–Puleo–Tennenhouse conjecture for directed triangle packing and covering
Statement
Let be a directed multigraph. Write for the maximum number of arc-disjoint directed triangles in , and write for the minimum number of arcs whose removal leaves no directed triangles. McDonald–Puleo–Tennenhouse conjecture.
McDonald, Puleo and Tennenhouse proved the preceding bound and posed this sharper conjecture. The paper proves an asymptotic upper bound with factor up to an term, while constructions show that a factor of at least is necessary asymptotically; the exact conjecture 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.