Eigenvalues and triangles in graphs
Bollobás and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859–865) conjectured the
following. If G is a Kr+ 1-free graph on at least r+ 1 vertices and m edges, then by
subdividing an edge. Both conditions are best possible. We conclude this paper with some
open problems.
following. If G is a Kr+ 1-free graph on at least r+ 1 vertices and m edges, then by
subdividing an edge. Both conditions are best possible. We conclude this paper with some
open problems.
Bollobás and Nikiforov (J. Combin. Theory Ser. B.97 (2007) 859–865) conjectured the following. If G is a Kr+1-free graph on at least r+1 vertices and m edges, then by subdividing an edge. Both conditions are best possible. We conclude this paper with some open problems.
Cambridge University Press以上显示的是最相近的搜索结果。 查看全部搜索结果