Erdős problem 1067 · problems.science

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

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:2053545d7cccdc60083340030a620a503afb22961ee48de911c29c2b223eb9ff
Metadata: sha256:25502545ff9fa0fc86fe78194213c08e08013a8aece2140c1cb17ff2bbc1ac1e
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:f125ae380898e0d2ed669d4b014ef6618d04a57eded09fca7125ab7374ec2281

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207