Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let be a graph on vertices, be the maximum number of edges that contain at most one edge from every triangle, and be the minimum number of edges that contain at least one edge from every triangle.
Is it true that
Source: erdosproblems.com/621
An accepted solution exists. The statement is true.
PROVED (LEAN), the site's label. The exact finite simple-graph inequality follows from Norin–Sun's stronger bipartite-deletion bound. The frontmatter standing is derived from the accepted claim page Norin and Sun's theorem, whose acceptance evidence is the site's and the refereed uptake; the public Lean proof of their theorem is linked from that page and described below, with its provenance; the corpus has not built it, and no refereed publication of the proof itself is recorded.