Erdős problem 108
For every r ≥ 4 and k ≥ 2 is there some finite f(k,r) such that every graph of chromatic number ≥ f(k,r) contains a subgraph of girth ≥ r and chromatic number ≥ k?
Result history
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 details
Exact provenance
- Problem row
- sha256:fca03b31e54cbbffba877fa1d2a6e001e7af711b5c38aec047cb0cee3a9dcddb
- Metadata
- sha256:f0acefc82d1c2c0a0797eacf526d2b5a8d1e6b108e0ee980e307d8f5311b7eef
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:dbf85068e0662df1e658d4890a7beeafc7e4013d79a89cd0fca2dee518e9ee99
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207