Finding Partite Hypergraphs Efficiently

Abstract

We provide a deterministic polynomial-time algorithm that, for a given $k$-uniform hypergraph $H$ with $n$ vertices and edge density $d$, finds a complete $k$-partite subgraph of $H$ with parts of size at least ${c(d, k)(\log n)^{1/(k-1)}}$. This generalizes work by Mubayi and Tur\'{a}n on bipartite graphs. The value we obtain for the part size matches the order of magnitude guaranteed by the non-constructive proof due to Erd\H{o}s and is tight up to a constant factor.