1 problem

Let $G$ be an $n$-vertex graph with $m$ edges. A book of size $k$ is a graph consisting of $k$ triangles sharing a common edge, and $\operatorname{bk}(G)$ denotes the largest such…