3 papers
math.CO2025
The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices
Doudou Hei, Xinmin Hou, Yue Ma
Given graphs and , the generalized Turán number $\ex(n, H, F)$ is defined as the maximum number of copies of in an -vertex graph that contains no copy of . The sus…
math.CO2025
Minimum saturated graphs without -cycles and -cycles
Yue Ma
Given a family of graphs , a graph is said to be -saturated if does not contain a copy of as a subgraph for any , but the add…
math.CO2023
On the saturation spectrum of the unions of disjoint cycles
Yue Ma
Let be a graph and be a family of graphs. We say is -saturated if does not contain a copy of with , but the addition of…