3 problems

Conlon–Fox–Sudakov conjecture. If $b(G)\le b$ and $G$ is not the balanced complete bipartite graph, then $G$ has at least

Let $G$ be a graph on $n$ vertices, and let $b(G)$ be its book number. For nonnegative integers $b$ and $n$ with $b\leq n/4$, let $S_{b,n}$ be the graph obtained by blowing up the…

Let $G$ be a graph on $n$ vertices, and let $b(G)$ denote its book number, the maximum number of triangles sharing an edge. Suppose that $G$ has $\lfloor n^2/4\rfloor+1$ edges. Erd…