Search Results for author: Binlong Li

Found 2 papers, 1 papers with code

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles

no code implementations8 Feb 2021 Binlong Li, Jie Ma, Bo Ning

Many years ago, Erd\H{o}s, Faudree, Schelp and Simonovits proposed the study of the function $\phi(n, d, k)$, and conjectured that for any positive integers $n>d\geq k$, it holds that $\phi(n, d, k)\leq \lfloor\frac{k-1}{2}\rfloor\lfloor\frac{n}{d+1}\rfloor+\epsilon$, where $\epsilon=1$ if $k$ is odd and $\epsilon=2$ otherwise.

Combinatorics

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