Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_10_28_louisd: Answers the site's wording (every number m of edges), not the corrected Statement (all sufficiently large m), so it does not count toward the problem's standing. Forum comments of 28 October 2025: for m in {2, 3, 4, 5, 7, 8, 9} the matching with m edges beats the graph as complete as possible.
Linked from (1)
Graph