Skip to content

Erdős problem 923

Is it true that, for every kk, there is some f(k)f(k) such that if GG has chromatic number ≥f(k)\geq f(k) then GG contains a triangle-free subgraph with chromatic number ≥k\geq k?

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:a1091a0f2c1ea7a31cc7d7a7009daca52f6bf4e8dc65e5f7e59168ec534028d1
Metadata
sha256:a15abcca1b672a9aa8a746b6c3e18247b933d2f08983c498d84f53ea8ec8ee12
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:c3d40d08c0eb41e22189d15224472fb9d7f6b11a98eca484ce30fbf98922823d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page