Jialin He

activity

20212024

most citedImprovements on induced subgraphs of given sizes

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

collaborators

2 papers

math.CO2022

The minimum number of clique-saturating edges

Jialin He, Fuhong Ma, Jie Ma +1

Let $G$ be a $K_{p}$ -free graph. We say $e$ is a $K_{p}$ -saturating edge of $G$ if $e \in / E (G)$ and $G + e$ contains a copy of $K_{p}$ . Denote by $f_{p} (n, e)$ the minimum number of $K_{p}$ -…

math.CO2021★ 1 cited

Improvements on induced subgraphs of given sizes

Jialin He, Jie Ma, Lilu Zhao

Given integers $m$ and $f$ , let $S_{n} (m, f)$ consist of all integers $e$ such that every $n$ -vertex graph with $e$ edges contains an $m$ -vertex induced subgraph with $f$ edges, and l…