Status
On this page
Status
Topics
Status
On this page
Status
Topics
Characterize those finite 3-uniform hypergraphs which appear in every 3-uniform hypergraph of chromatic number .
Source: erdosproblems.com/593
A full solution has been claimed but not yet accepted. Settled in another form, for example when its parts resolve differently or the question is open-ended.
OPEN, the site's label. The site's proof-claims tab carries two full proof claims, both found with AI systems and both with Lean developments; the site shows no verdict on either and its label is unchanged (proof-claims thread accessed 2026-10-06). The derived standing departs from the label because the two claims are pending full claims that give the same characterization, recorded on their claim pages, so the problem is claimed as answered; neither is refereed or reviewed by anyone the record names, so neither is accepted.