Claims

../

2016_02_13_norin_sun: Norin and Sun prove that the largest edge set meeting each triangle at most once plus the fewest edges whose deletion makes the graph bipartite is at most n squared over 4, which implies the problem's inequality; adopted by the site.

---