A spectral version of Mantel's theorem
暂无分享，去创建一个
[1] A. Rényii,et al. ON A PROBLEM OF GRAPH THEORY , 1966 .
[2] I. Reiman. Über ein Problem von K. Zarankiewicz , 1958 .
[3] C. S. Edwards,et al. Lower bounds for the clique and the chromatic numbers of a graph , 1983, Discret. Appl. Math..
[4] M. Simonovits,et al. The History of Degenerate (Bipartite) Extremal Graph Problems , 2013, 1306.5167.
[5] Vladimir Nikiforov,et al. Some Inequalities for the Largest Eigenvalue of a Graph , 2002, Combinatorics, Probability and Computing.
[6] L. Collatz,et al. Spektren endlicher grafen , 1957 .
[7] Béla Bollobás,et al. Cliques and the spectral radius , 2007, J. Comb. Theory, Ser. B.
[8] Ji-Ming Guo,et al. Some upper bounds on the spectral radius of a graph , 2020 .
[9] Eigenvalues and triangles in graphs , 2019, Combinatorics, Probability and Computing.
[10] Zoltán Füredi,et al. Graphs without quadrilaterals , 1983, J. Comb. Theory, Ser. B.
[11] Baofeng Wu,et al. The spectral radius of trees on k pendant vertices , 2005 .
[12] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[13] Vladimir Nikiforov. Walks and the spectral radius of graphs , 2005 .
[14] Zoltán Füredi,et al. On the Number of Edges of Quadrilateral-Free Graphs , 1996, J. Comb. Theory, Ser. B.
[15] V. Nikiforov. The maximum spectral radius of C4-free graphs of given order and size , 2007, 0712.1301.