Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences (Q870982)

The authors continue the study of a variation of a classical Turán-type extremal problem: determine the smallest even integer \(\sigma(K_{r_1,r_2,\dots, r_l,r,s},n)\) such that every \(n\)-term graphic sequence \(\pi= (d_1,d_2,\dots, d_n)\) with term sum \(\sigma(\pi)= d_1+ d_2+\cdots+ d_n\geq \sigma(K_{r_1,r_2,\dots, r_l,r,s},n)\) has a realization \(G\) containing \(K_{r_1,r_2,\dots, r_l,r,s}\) as a subgraph. The authors prove exact value of \(\sigma(K_{r_1,r_2,\dots, r_l,r,s},n)\) for sufficiently large \(n\), where \(r\geq 3\) (see Theorem 1.2).