Erdős problem 1068 · problems.science

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

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:8a089e033a629f2023b1c9d9e87523dce734390ea63c8531d2271331769576d4
Metadata: sha256:cf9fd8e9f99d13982d827c93e2dea295a22e7d7fa74d1e752f2ef97a6c491a71
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:14f5951e9d125a046624e867a658fa441b57ce8083e9d081e30007165ead9be0

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