Yue Ma

activity

20232026

collaborators

Showing math.COShow all

4 papers · 1 filter

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 sus…

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…

math.CO2023

On the saturation spectrum of the unions of disjoint cycles

Yue Ma

Let $G$ be a graph and $H$ be a family of graphs. We say $G$ is $H$ -saturated if $G$ does not contain a copy of $H$ with $H \in H$ , but the addition of…

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

On the saturation spectrum of the unions of disjoint cycles

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