Regenerated from the community database (Apache-2.0), dated, and linked back to it
from every problem. erdosproblems.com no longer shows statuses (Bloom's reasons); this is the database's record, not our verdict.
908 of 1221 statements are formalized in Lean (Formal Conjectures) · 107 carry an Erdős prize · 3 are independent of ZFC and 9 more can't be proved, or can't be disproved, from ZFC alone · “open” counts the computable and Lean-checked ones too.
If \(G\) is a group, can there exist an exact covering of \(G\) by more than one coset of different sizes? (i.e. each element is contained in exactly one of the cosets.) The conjectured answer is no: in every such exact covering, two of…
Let \(G\) be a group and \(\Gamma=\Gamma(G)\) be the non-commuting graph, with vertices the elements of \(G\) and an edge between \(g\) and \(h\) if and only if \(g\) and \(h\) do not commute, \(gh\neq hg\). If \(\Gamma\) contains no…
Source: teorth/erdosproblems (its own interactive table), Apache-2.0, pulled 2026-10-21. A status here is what that database records, not an independent verification by us, except where a problem page says so.