加载中…
We prove that the set of the smallest eigenvalues attained by -colorable graphs is dense in , where and is the positive real root of . As a consequence, in the context of spherical two-distance sets, our result precludes any further refinement of the forbidden-subgraph method through the chromatic number of signed graphs.

生成讲解博客的中文版本

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