Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let . What is the best possible such that
for any graph on edges without isolated vertices?
Source: erdosproblems.com/569
A full solution has been claimed but not yet accepted. Settled in another form, for example when its parts resolve differently or the question is open-ended.
The site labels the problem OPEN. The triangle case follows classically from Goddard and Kleitman's theorem and the one-edge endpoint described below, and is recorded as an accepted partial claim on Goddard and Kleitman 1994 and on Sidorenko 1993, who proved the same theorem independently. For every , the pending claim gives the exact answer , by Cambie--Freschi Theorem 3 and the same endpoint. The preprint claims the needed upper bound, but specific unverified proof concerns remain unresolved and acceptance has not been established. The claim is recorded on its claim page (Cambie and Freschi, 2026), and the frontmatter's standing is derived from that page as claimed, through the pending full claim; that standing is not a refutation of the claim.