ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a directed multigraph. Write νt(D)\nu_t(D) for the maximum number of arc-disjoint directed triangles in DD, and write τt(D)\tau_t(D) for the minimum number of arcs whose removal leaves no directed triangles. McDonald–Puleo–Tennenhouse conjecture.

τt(D)≤1.5νt(D).\tau_t(D)\le 1.5\nu_t(D).

McDonald, Puleo and Tennenhouse proved the preceding bound τt(D)≤2νt(D)−1\tau_t(D)\le 2\nu_t(D)-1 and posed this sharper conjecture. The paper proves an asymptotic upper bound with factor 1.81.8 up to an o(n2)o(n^2) term, while constructions show that a factor of at least 1.51.5 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 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.