1 problem

Let $t>s\ge 3$. For $t\le 2s-1$, let $\mathcal{H}(n,s,t)$ be the family of graphs from the stated construction: partition the vertex set into $V_1\cup\cdots\cup V_s$, use an extrem…