Density of balanced 3-partite graphs without 3-cycles or 4-cycles (Q2112583): Difference between revisions

Summary: Let \(C_k\) be a cycle of order \(k\), where \(k\geqslant 3\). Let \(\mathrm{ex}(n, n, n, \{C_3, C_4\})\) be the maximum number of edges in a balanced \(3\)-partite graph whose vertex set consists of three parts, each has \(n\) vertices that has no subgraph isomorphic to \(C_3\) or \(C_4\). We construct dense balanced 3-partite graphs without 3-cycles or 4-cycles and show that \(\mathrm{ex}(n, n, n, \{C_3, C_4\})\geqslant (\frac{6\sqrt{2}-8}{(\sqrt{2}-1)^{3/2}}+o(1))n^{3/2}\).