Skip to content

Erdős problem 835

Does there exist a k>2k>2 such that the kk-sized subsets of {1,...,2k} can be coloured with k+1k+1 colours such that for every A{1,,2k}A\subset \{1,\ldots,2k\} with A=k+1\lvert A\rvert=k+1 all k+1k+1 colours appear among the kk-sized subsets of AA?

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:67473a3c72fdd782db39191353293b30d9bed61c23c4bbadbd97dd98244906c4
Metadata
sha256:10d761f7f9e34eb44e11afeb97afd4d102b0f20017b3a6923235376686c9733e
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:d7945337f566a76fabdbda3e762d34450ced06ccbf5f755c0da72b1246f0e0e3
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page