Skip to content

Erdős problem 1067

Start work

Does every graph with chromatic number ℵ1\aleph_1 contain an infinitely connected subgraph with chromatic number ℵ1\aleph_1?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:2053545d7cccdc60083340030a620a503afb22961ee48de911c29c2b223eb9ff
Metadata
sha256:25502545ff9fa0fc86fe78194213c08e08013a8aece2140c1cb17ff2bbc1ac1e
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:f125ae380898e0d2ed669d4b014ef6618d04a57eded09fca7125ab7374ec2281
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON