When: Sunday, May 25, 10am

Where: Schreiber 309

Speaker: Moshe Rosenfeld, Seattle

Title: The odd-distance graph

- Its chromatic number is at least 5, no upper bound is known.
- Its List chromatic number is Aleph_0
- Forbidden subgraphs.
- Faithful embedding of 3-colorable graphs.
- Faithful embeddings of infinite graphs.
- An ever growing list of related open problems.

redesigned by barak soreq