3 papers
math.CO2025
Spectral Turán-type problem in non--partite graphs: Forbidden generalized book graph
Yuantian Yu, Shuchao Li
Given a graph , a graph is said to be -free if it does not contain as a subgraph. A graph is color-critical when it has an edge whose removal leads to a reduction in its…
math.CO2025
The exact Turán number of generalized book graph in non--partite graphs
Yuantian Yu, Shuchao Li
Given a graph we say that a graph is \textit{-free} if it does not contain as a subgraph. The Turán number $\ex(n,H)$ of is the maximum number of edges in an -v…
math.CO2024
Turán-type problems on -factors of graphs, and beyond
Yifang Hao, Shuchao Li
Given a set of graphs , we say that a graph is \textit{-free} if it does not contain any member of as a subgraph. Let $\text{ex}(n,\math…