Skip to content

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.

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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.

Open exact source location