On the maximum number of triangles in tripartite graphs with no $4$-cycles between any two parts

RESUMO

Let $G$ be a $3$-partite graph with $k$ vertices in each part such that the bipartite graph induced by any two parts contains no cycle of length four. Fischer and Matoušek [J. Combin. Theory Ser. A, 2001] asked for the maximum number of triangles in such a graph. They obtained the lower bound $(1-o(1))k^{3/2}$ and the upper bound $k^{7/4}+O(k^{3/2})$. Coulter, Matthews and Timmons [J. Combin. Theory Ser. B, 2018] later constructed such graphs using planar polynomials over finite fields and improved the lower bound to $(1-o(1))k^{5/3}$. In this note, we use a new triple of planar polynomials and further improve the lower bound to $(1-o(1))k^{17/10}$.