google-deepmind / google-deepmind/formal-conjectures

Erdős Probelm 802

Open
#952 0 comments 0 reactions 0 assignees View on GitHub
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

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.