For a fixed integer , let denote the vertex-disjoint union of triangles. A recent fixed-size spectral theorem of Das and Yamini asserts that, for all sufficiently large , every -free graph of size satisfies and equality holds if and only if and for some . They explicitly posed the open problem: Let be fixed and be a residue in . For all sufficiently large integers , determine the exact value of and characterize all graphs attaining this maximum. In this paper, using the positive-defect version of the bounded-core method for divisible sizes together with several new ideas developed in this paper, we give a complete solution to the aforementioned open problem.

生成讲解博客的中文版本

生成AI智能校验的中文版本