Erdős Problem #1177
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: set theory, chromatic number, hypergraphs.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1177 asks the following. The maintained status is OPEN.
For a finite 3-uniform hypergraph \(G\), define \(F_G(\kappa)\) as 3-uniform hypergraphs of chromatic number \(\kappa\) avoiding \(G\). Erdős–Galvin–Hajnal ask three separate things: (i) \(F_G(\aleph_1)\) nonempty implies a witness with at most \(2^{2^{\aleph_0}}\) vertices; (ii) if \(F_G(\aleph_1)\) and \(F_H(\aleph_1)\) are both nonempty, they have a common witness; (iii) nonempty \(F_G(\kappa)\) for one uncountable \(\kappa\) implies nonempty \(F_G(\lambda)\) for every uncountable \(\lambda\). Weak hypergraph chromatic means no monochromatic edge; source-verify this convention.
A small example
The complete 3-uniform hypergraph on four vertices has chromatic number 2, since 2+2 coloring avoids monochromatic triples. On five vertices every 2-coloring has a class of size at least 3 and thus a monochromatic triple; a 2+2+1 coloring works, so its chromatic number is 3. Both are independently checked by exact enumeration. They are not uncountable chromatic examples.
What is known
https://www.erdosproblems.com/1177 lists all three as OPEN, Vardi [Va99,7.94]. The live discussion includes a proof claim, but no independently verified general proof of any exact subquestion is established by that metadata. \(2^{2^{\aleph_0}}\) is double cardinal exponentiation, not a finite size.
GCL's current state
Authenticated original-issue RESULT/1 research return. GCL independently replayed only the exact bounded fixture in ci/erdos_compendium_007_phase21_checks.py. The general theorem statements above are attributed to their external sources rather than independently certified. This is a locally authored and unaccepted draft.
What remains
Source-read original Erdős–Galvin–Hajnal and Vardi §7.94, check induced versus ordinary forbidden \(G\), weak chromatic convention, and three separate quantifier statements. Review but do not prematurely accept online proof claims.
Protected V2 admission requires source fidelity, manuscript QA and any mandatory independent critic reviews; none is inferred from this finite example.
Sources and claim boundaries
https://www.erdosproblems.com/1177 ; [Va99,7.94], Erdős–Galvin–Hajnal.
Finite evidence receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE21.json. Original GitHub source issue identities unchanged; source-fidelity adjudication, public deployment and V2 editorial acceptance PENDING.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2448 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.