Search Results for author: Jialin He

Found 2 papers, 0 papers with code

Improvements on induced subgraphs of given sizes

no code implementations11 Jan 2021 Jialin He, Jie Ma, Lilu Zhao

al. Our second result considers infinitely many pairs $(m, f)$ of special forms, whose exact values of $\sigma(m, f)$ were conjectured by Erd\H{o}s et.

Combinatorics

Some exact results on $4$-cycles: stability and supersaturation

no code implementations2 Dec 2019 Jialin He, Jie Ma, Tianchi Yang

A longstanding conjecture of Erd\H{o}s and Simonovits states that every $n$-vertex graph with $ex(n, C_4)+1$ edges contains at least $(1+o(1))\sqrt{n}$ 4-cycles.

Combinatorics

Cannot find the paper you are looking for? You can Submit a new open access paper.