Erdős Problem #1177 — Omitting finite triple systems at uncountable chromatic number
For a finite triple system , consider triple systems that omit and have uncountable chromatic number. (a) If one exists, must one exist with cardinality at most ? (b) If finite triple systems and can each be omitted by an uncountably chromatic triple system, must some uncountably chromatic triple system omit both? (c) If a -chromatic triple system omitting exists for some uncountable cardinal , must one exist for every uncountable cardinal ?
References
Primary source
Additional references
Some of Paul's favorite problems, problem booklet circulated at Paul Erdős and his mathematics, Budapest, July 1999.
Progress summary
A 2026 preprint claims that every finite forbidden triple system has either no uncountable exact chromatic sizes or all of them, but the claim is not yet independently confirmed.
Erdős Problem #1177 asks which exact uncountable chromatic cardinalities can occur for systems avoiding a fixed finite triple system, and how different avoidance classes intersect. The recent formulation concerns exact chromatic number and extends to all uncountable cardinals.
2026 claimed resolution
A preprint claims the complete dichotomy
It reports the three clauses of Problem #1177 as yes, no, and yes: a witness at can have size at most ; two specified forbidden systems—two triples sharing a pair and the loose -cycle—have nonempty individual classes but empty intersection; and existence at one uncountable cardinal implies existence at every uncountable cardinal. Version 2 states that the results were formally verified in Lean 4.
Current status (as of June 2026): A preprint claims to settle the exact-spectrum classification and all three clauses, but independent mathematical confirmation is still lacking.
Sources
Solutions 0
No solutions have been posted yet.