5 papers
A spectral Lovász-Simonovits theorem
Yongtao Li, Lihua Feng, Yuejian Peng
A fundamental result in extremal graph theory is attributed to Mantel's theorem, which states that every graph on vertices with more than edges must con…
Spectral supersaturation: Triangles and bowties
Yongtao Li, Lihua Feng, Yuejian Peng
Recently, Ning and Zhai (2023) proved that every -vertex graph with has at least triangles, unless $G=K_{\lce…
A spectral ErdÅs-Faudree-Rousseau theorem
Yongtao Li, Lihua Feng, Yuejian Peng
A well-known theorem of Mantel states that every -vertex graph with more than edges contains a triangle. An interesting problem in extremal graph theory…
Stabilities for non-uniform -intersecting families
Yongtao Li, Biao Wu
The study of intersection problems on families of sets is one of the most important topics in extremal combinatorics. As we all know, the extremal problems involving certain inters…
A spectral ErdÅs-Rademacher theorem
Yongtao Li, Lu Lu, Yuejian Peng
A classical result of ErdÅs and Rademacher (1955) indicates a supersaturation phenomenon. It says that if is a graph on vertices with at least $\lfloor {n^2}/{4} \rfloor +…