You need to log in to edit.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

no code implementations • 8 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

1 code implementation • 23 Jun 2020 • Jamie Pool, Ebrahim Beyrami, Vishak Gopal, Ashkan Aazami, Jayant Gupchup, Jeff Rowland, Binlong Li, Pritesh Kanani, Ross Cutler, Johannes Gehrke

Web-scale applications can ship code on a daily to weekly cadence.

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

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.