Yue Ma

collaborators

3 papers

math.CO2026

On saturation problems involving clique number and matching number

Zian Chen, Guorong Gao, Jianfeng Hou +1

For a clique $K_{r}$ , a graph is $K_{r}$ -saturated if it contains no copy of $K_{r}$ and the addition of any edge from its complement creates a $K_{r}$ . A classical result of ErdÅs-Hajnal…

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 $H$ and $F$ , the generalized TurÃ¡n number $\ex(n, H, F)$ is defined as the maximum number of copies of $H$ in an $n$ -vertex graph that contains no copy of $F$ . The su…

math.CO2025

Minimum saturated graphs without $4$ -cycles and $5$ -cycles

Yue Ma

Given a family of graphs $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a copy of $F$ as a subgraph for any $F \in F$ , but the add…

On saturation problems involving clique number and matching number

The generalized TurÃ¡n number for K_3 in graphs without suspensions of a path on five vertices

Minimum saturated graphs without 4-cycles and 5-cycles

Minimum saturated graphs without $4$ -cycles and $5$ -cycles