Skip to content

Erdős problem 1176

Let GG be a graph with chromatic number ℵ1\aleph_1. Is it true that there is a colouring of the edges with ℵ1\aleph_1 many colours such that, in any countable colouring of the vertices, there exists a vertex colour containing all edge colours?

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:87aeba9680887f54a38b0e714f3fc94796bff907d028758e02287ab650a11189
Metadata
sha256:22f2919440a391bcebf3f05794cd599dd668eb227e253926335757fcdaa80e4f
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6e382282656c2f257086bca78b53882bb4765df4b1cb0c9aaaf8589fabc02e56
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page