I will show a number of old and new applications of adjoint functors on categories of relational structures. They include a construction of CSPs of width 1 (a.k.a. tree duality); a construction of graphs with a high chromatic number and no short odd cycles; resourcesharing system scheduling; and the failure of several potential approaches to Hedetniemi’s product-coloring conjecture.