activity
20192026
most citedImprovements on induced subgraphs of given sizes

1 citations · 1 across the 17 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

cs.CC2026

NP-hardness of additive approximation for generalized Turán problems

Yihan Chen, Jialin He, Xihe Li +2

For a fixed graph and a fixed nonempty family of graphs, let denote the maximum number of copies of in an …

math.CO2026

On three open problems in zero-sum Ramsey numbers

Cheng Chi, Jialin He, Quan Sun

Let denote the -vertex complete -uniform hypergraph. For an -uniform hypergraph and an integer , the -color Ramsey number is the least…

math.CO2026

A note on zero-sum Ramsey numbers of complete graphs

Cheng Chi, Jialin He, Fuhong Ma

For a graph with , the zero-sum Ramsey number is the least integer such that every labeling of the edges of by elements of contains a c…

math.CO2026

On Zero-sum Ramsey numbers of complete bipartite graphs

Cheng Chi, Jialin He

For an integer and a graph satisfying , the zero-sum Ramsey number is the least integer such that every edge-labeling $w\colon E(K_n…

math.CO2026

On zero-sum Ramsey numbers of cycles and wheels

Cheng Chi, Jialin He

For an integer and a graph with , let be the least integer such that every edge-labeling contains a copy of wh…

math.CO2026

Saturation numbers for -uniform Berge-

Yihan Chen, Jialin He, Tianying Xie

The saturation number is the minimum number of hyperedges in an -uniform -saturated hypergraph on vertices. We determine this para…