9 papers
Saturation numbers of some joins of graphs
Xinying Hua, Yuejian Peng
Let be a graph. A graph is -saturated if is -free, but adding any edge between two non-adjacent vertices of yields an -copy as a subgraph. The saturation n…
Saturation numbers for joins of graphs and characterization of extremal graphs
Xinying Hua, Yuejian Peng
A graph is -saturated if contains no -copy as a subgraph, but adding any edge between two non-adjacent vertices in creates a copy of . The saturation number $\…
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…
A note on degree conditions for Ramsey goodness of trees
Zhidan Luo, Yuejian Peng
For given graphs and , let denote that each red-blue-coloring of yields a red copy of or a blue copy of . Arag…
Spectral extremal graphs for -free graphs with even size
Loujun Yu, Yuejian Peng
Let be the fan graph obtained by joining a vertex with a path on vertices. Yu, Li and Peng [Discrete Math. 346 (2023)] conjectured that if the number of edges of is…
Strong spectral stabilities for -free graphs
Lantao Zou, Yongtao Li, Yuejian Peng
A stability result due to Ren, Wang, Wang and Yang [SIAM J. Discrete Math. 38 (2024)] shows that if and , and is a -free graph on $…