google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 766
Open
ams-05: Combinatorics
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 328
Description
### What is the conjecture
https://www.erdosproblems.com/766
Let $f(n;k,l)=\min \mathrm{ex}(n;G)$, where $G$ ranges over all graphs with $k$ vertices and $l$ edges.
Give good estimates for $f(n;k,l)$ in the range $k
Contributor guide
Assessment
This issue has not been assessed yet.