Homomorphisms of products of graphs into graphs without four cycles (Q1603261): Difference between revisions

For two graphs \(A\) and \(G\), we write \(A\rightarrow G\) if there is a homomorphism of \(A\) to \(G\) and \(A\not\rightarrow G\) if there is no such homomorphism. The authors show that if \(A\) and \(B\) are connected graphs, each containing a triangle, and \(G\) is \(C_4\)-free with \(A\not\rightarrow G\) and \(B\not\rightarrow G\) then \(A\times B\not\rightarrow G\) (here ``\(\times\)'' stands for the categorical product).