Rosenfeld’s Odd-Distance Problem


Moshe Rosenfeld’s odd-distance problem: Let G be the graph whose vertices are points in the plane and two vertices form an edge if their distance is an odd integer. Is the chromatic number of this graph finite?


Here is a link to a paper on the problem by Hayri Ardal, Jan Manuch, Moshe Rosenfeld, Shaharon Shelah, and Ladislav Stacho.

This entry was posted in Combinatorics, Open problems. Bookmark the permalink.

2 Responses to Rosenfeld’s Odd-Distance Problem

  1. Gil Kalai says:

    Update: Moshe is here, and he just told me that it follows from a theorem of Furstenberg, Katzenelson, and Weiss that if every color class is measurable than infinitely many colors are needed!

  2. Pingback: Aubrey de Grey: The chromatic number of the plane is at least 5 | Combinatorics and more

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s