Every road in this little town is a one-way street, and each street is colored either red or blue. This has a helpful effect: If you start at any house in town and follow the sequence blue-red-red three times in a row, you’ll always arrive at the yellow house.

If you follow blue-blue-red three times, you’ll always arrive at the green one.

In 1970 Roy Adler and Benjamin Weiss asked whether it’s always possible to create such a coloring in a given network; in 2009 Avraham Trahtman proved that, within certain constraints, it is.