加载中…
Half a century ago, Bollobás and Erdős [Bull. London Math. Soc. 5 (1973)] proved that every -vertex graph with edges contains a blowup with . A well-known theorem of Nikiforov [Combin. Probab. Comput. 18 (3) (2009)] asserts that if is an -vertex graph with adjacency spectral radius , then contains a blowup with . This gives a spectral version of the Bollobás–Erdős theorem. In this paper, we systematically explore variants of Nikiforov’s result in terms of the signless Laplacian spectral radius, extending the supersaturation, blowup of cliques and the stability results.

生成讲解博客的中文版本

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