Abstract. We study how many copies of a graph [Formula: see text] that another graph [Formula: see text] with a given number of cliques is guaranteed to have. For example, one of our main results states that for all [Formula: see text], if [Formula: see text] is an [Formula: see text]-vertex graph with [Formula: see text] triangles and [Formula: see text] is sufficiently large in terms of [Formula: see text], then [Formula: see text] contains at least [Formula: see text] copies of [Formula: see text], and, furthermore, we show that these bounds are essentially best possible provided that either [Formula: see text] or certain bipartite analogues of well-known conjectures for Turán numbers hold.

In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. •Panchromatic Graphs: For fixed$k\in \mathbb{N}$, a$k$-panchromatic graph is, roughly speaking, a balanced bipartite graph with one partition class equipartitioned into$k$colour classes in which the common neighbourhoods of panchromatic$k$-sets of vertices are much larger than those of$k$-sets that repeat a colour. The question of their existence was raised by Karthik and Manurangsi [Combinatorica 2020]. •Threshold Graphs: For fixed$k\in \mathbb{N}$, a$k$-threshold graph is, roughly speaking, a balanced bipartite graph in which the common neighbourhoods of$k$-sets of vertices on one side are much larger than those of ($k+1$)-sets. The question of their existence was raised by Lin [JACM 2018]. Concretely, we provide probability distributions over graphs from which we can efficiently sample these objects in near linear time. These probability distributions are defined via varieties cut out by (carefully chosen) random polynomials, and the analysis of these constructions relies on machinery from algebraic geometry (such as the Lang-Weil estimate, for example). The technical tools developed to accomplish this might be of independent interest. As applications of our constructions, we show the following conditional time lower bounds on the parameterized set intersection problem where, given a collection of$n$sets over universe [$n$] and a parameter$k$, the goal is to find$k$sets with the largest intersection. •Assuming ETH, for any computable function$F:\mathbb{N}\rightarrow \mathbb{N}$, no$n^{o(k)}$-time algorithm can approximate the parameterized set intersection problem up to factor$F(k)$. This improves considerably on the previously best-known result under ETH due to Lin [JACM 2018], who ruled out any$n^{o(\sqrt{k})}$time approximation algorithm for this problem. •Assuming SETH, for every$\varepsilon > 0$and any computable function$F:\mathbb{N} \rightarrow \mathbb{N}$, no$n^{k-\varepsilon}$-time algorithm can approximate the parameterized set intersection problem up to factor$F(k)$. No result of comparable strength was previously known under SETH, even for solving this problem exactly. Both these time lower bounds are obtained by composing panchromatic graphs with instances of the coloured variant of the parameterized set intersection problem (for which tight lower bounds were previously known).