On subgraphs of tripartite graphs

From MaRDI portal



Abstract: Bollob'{a}s, ErdH{o}s, and Szemer'{e}di [Discrete Math 13 (1975), 97--107] investigated a tripartite generalization of the Zarankiewicz problem: what minimum degree forces a tripartite graph with n vertices in each part to contain an octahedral graph K3(2)? They proved that n+2−1/2n3/4 suffices and suggested it could be weakened to n+cn1/2 for some constant c>0. In this note we show that their method only gives n+(1+o(1))n11/12 and provide many constructions that show if true, n+cn1/2 is better possible.












This page was built for publication: On subgraphs of tripartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2092375)