Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let . Is it true that, if is sufficiently large, for any graph on edges without isolated vertices,
Source: erdosproblems.com/570
An accepted solution exists. The statement is true.
The site labels the problem PROVED (page last edited 16 January 2026, accessed 2026-09-08), and CFMPP26 states the eventual bound for every . The direct primary-source coverage is incomplete only at , as explained below. The claim pages record the results behind the label with their postings and acceptance evidence: Sidorenko 1993 and Goddard and Kleitman 1994 for , Erdős, Faudree, Rousseau and Schelp 1993 for even , Jayawardene 1999 for (second-hand, the thesis unread), and Cambie, Freschi, Morawski, Petrova and Pokrovskiy 2026 for odd and the whole statement, accepted on the site curator's record since the preprint is not refereed; the frontmatter standing derives from these pages.