Skip to content

Erdős problem 1068

Start work

Does every graph with chromatic number ℵ1\aleph_1 contain a countable subgraph which is infinitely connected?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:8a089e033a629f2023b1c9d9e87523dce734390ea63c8531d2271331769576d4
Metadata
sha256:cf9fd8e9f99d13982d827c93e2dea295a22e7d7fa74d1e752f2ef97a6c491a71
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:14f5951e9d125a046624e867a658fa441b57ce8083e9d081e30007165ead9be0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON