Erdős problem 130
For an infinite planar set in strong general position, how large can the chromatic and clique numbers of its positive-integer-distance graph be - in particular, can the chromatic number be infinite? Yes: there is such a set, no three collinear and no four concyclic, with infinite chromatic number.
Workspace
public preview
- #130
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
argument
- Machine
- Reported outcome