1 problem

Let $b(d)$ be defined by … where $a(n)$ is the sequence specified in the paper. For a graph $G$, let $\operatorname{bp}_2(G)$ be the least number of bipartite cliques in a $2$-cove…