Eigenvalues and triangles in graphs

H Lin, B Ning, B Wu - Combinatorics, Probability and Computing, 2021 - cambridge.org
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 …
被引用次数：90 相关文章

Eigenvalues and triangles in graphs.

H Lin, B Ning, B Wu - Combinatorics, Probability & …, 2021 - search.ebscohost.com
Bollobás and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859–865) conjectured the
following. If G is a K< sub> r+ 1-free graph on at least r+ 1 vertices and m edges, then λ< …

Eigenvalues and triangles in graphs

H Lin, B Ning, B Wu - arXiv preprint arXiv:1910.12474, 2019 - arxiv.org
Bollob\'as and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the
following. If $ G $ is a $ K_ {r+ 1} $-free graph on at least $ r+ 1$ vertices and $ m $ edges …

Eigenvalues and triangles in graphs

H Lin, B Ning, B Wu - arXiv e-prints, 2019 - ui.adsabs.harvard.edu
Bollobás and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the
following. If $ G $ is a $ K_ {r+ 1} $-free graph on at least $ r+ 1$ vertices and $ m $ edges …

Eigenvalues and triangles in graphs

H Lin, B Ning, B Wu - Combinatorics, Probability & Computing, 2021 - search.proquest.com
Bollobás and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859–865) conjectured the
following. If G is a K r+1-free graph on at least r+1 vertices and m edges, then\({\rm …

Eigenvalues and triangles in graphs

H Lin, B Ning, B Wu - Combinatorics, Probability and Computing, 2021 - cambridge.org
Eigenvalues and triangles in graphs Page 1 Combinatorics, Probability and Computing (2021),
30, pp. 258–270 doi:10.1017/S0963548320000462 ARTICLE Eigenvalues and triangles in …