Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets

Attila Pór, David R. Wood

Let $F$ be a family of connected bipartite graphs, each with at least three vertices. A proper vertex colouring of a graph $G$ with no bichromatic subgraph in $F$ is $\F$-free. The…