google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 1009
Open
ams-05: Combinatorics
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 327
Description
### What is the conjecture
https://www.erdosproblems.com/1009
Is it true that, for every $c>0$, there exists $f(c)$ such that every graph on $n$ vertices with at least $\lfloor n^2/4\rfloor+k$ edges, where $k
Contributor guide
Research direction
Read the conjecture and its solved status at https://www.erdosproblems.com/1009, then inspect the repository's existing formalized conjectures for the appropriate entry point and conventions. Done means adding a Lean formalization of Erdős Problem 1009 that matches the stated graph-theoretic claim.
Written by the indexing model from the issue text.
Assessment
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100