Erdős problem 753
The list chromatic number is defined to be the minimal such that for any assignment of a list of colours to each vertex of (perhaps different lists for different vertices) a colouring of each vertex by a colour on its list can be chosen such that adjacent vertices receive distinct colours.
Erdős Problems records this as disproved (Lean).
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal2 retained
- Resolutiondisproved (Lean)
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it280 share a topic
None carries a Standing. Browse the topic.