Kavli Affiliate: Jing Wang | First 5 Authors: Zhenyu Ni, Jing Wang, Liying Kang, , | Summary: For a simple graph $F$, let $mathrm{EX}(n, F)$ and $mathrm{EX_{sp}}(n,F)$ be the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an $n$-vertex graph without any copy […]
Continue.. Extremal problems for disjoint graphs