加载中…
Let be a graph and be integers. We prove that if is an -vertex graph with no copy of and no induced copy of , then where is the spectral radius of the adjacency matrix of . Our results are motivated by results of Babai, Guiduli, and Nikiforov bounding the maximum spectral radius of a graph with no copy (not necessarily induced) of .

生成讲解博客的中文版本

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