Erdos Problems #593 and #1177
Prior state unknown→proved
settles two numbered Erdos problems at once
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics / Infinite combinatorics
Erdos Problems #593 and #1177
Erdos Problem #593 asks which finite triple systems occur in every uncountably chromatic triple system. The answer is exactly the class generated from private-vertex expansions of finite bipartite graphs by finite disjoint unions and one-point amalgamations. Problem #1177 on exact spectra is settled alongside it.
13Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
Erdos Problem #593 asks which finite triple systems occur in every uncountably chromatic triple system. The answer is exactly the class generated from private-vertex expansions of finite bipartite graphs by finite disjoint unions and one-point amalgamations. Problem #1177 on exact spectra is settled alongside it.
settles two numbered Erdos problems at once
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.