google-deepmind / google-deepmind/formal-conjectures
Erdős Probelm 802
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/802
Is it true that any graph $K_r$-free graph on $n$ vertices with average degree $t$ contains an independent set on
$$\gg_r \frac{\log t}{t}n$$
many vertices?
Status: open
### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else
Contributor guide
Assessment
This issue has not been assessed yet.