Loading problem…
Status
On this page
Status
Topics
Problem 1037
Let be a graph on vertices in which every degree occurs at most twice, and the number of distinct degree is . Must contain a trivial (empty or complete) subgraph of size 'much larger' than ?
Source: erdosproblems.com/1037
- Graph theory
Status
Solved, DisprovedAn accepted solution exists. The statement is false.
DISPROVED (LEAN), the site's label. The claim page (Cambie, Chan and Hunter) records the construction the site credits, with the Lean formalization of it in Boris Alexeev's repository linked from that page; the formalization was not built or audited here, and the standing rests on the site's acceptance.