Yihan Chen

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs

Yihan Chen, Tianying Xie

For graphs $F$ and $H$ , a spanning subgraph $G$ of $F$ is weakly $H$ -saturated in $F$ if the edges in $E (F) ∖ E (G)$ can be added one at a time, each addition creating a new…

math.CO2026

Saturation numbers for $3$ -uniform Berge- $K_{4}$

Yihan Chen, Jialin He, Tianying Xie

The saturation number $sat_{r} (n, F)$ is the minimum number of hyperedges in an $r$ -uniform $F$ -saturated hypergraph on $n$ vertices. We determine this para…

math.CO2025

On the $4$ -clique cover number of graphs

Yihan Chen, Jialin He, Tianying Xie

In 1966, Erdős, Goodman, and Pósa proved that $⌊ n^{2} /4 ⌋$ cliques are sufficient to cover all edges in any $n$ -vertex graph, with tightness achieved by the balanced com…

math.CO2024

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree

Yihan Chen, Jialin He, Allan Lo +3

In 1975 Bollobás, Erdős, and Szemerédi asked what minimum degree guarantees an octahedral subgraph $K_{3} (2)$ in any tripartite graph $G$ with $n$ vertices in each vertex class. We s…

The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs

Saturation numbers for 3-uniform Berge-K4​

On the 4-clique cover number of graphs

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree

Saturation numbers for $3$ -uniform Berge- $K_{4}$

On the $4$ -clique cover number of graphs