2 problems

Let $G_n$ be the graph obtained from the crown graph $H_{n,n}$ by adding an apex, that is, a vertex adjacent to every vertex of $H_{n,n}$. The apex crown graph extremal conjecture.…

Let $H_{n,n}$ be the crown graph obtained from the complete bipartite graph on two parts of size $n$ by deleting a perfect matching. The crown graph extremal conjecture. $H_{n,n}$…