If $G$ is a graph with at most $k$ edge disjoint triangles then can $G$ be made triangle-free after removing at most $2k$ edges?

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

* (\nu(G)) = the **largest** number of **edge-disjoint** triangles in $G$, * (\tau(G)) = the **smallest** number of edges you must delete to make $G$ **triangle-free** (an edge set that hits every triangle).

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.