google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 576

Open
#805 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)
327

Description

### What is the conjecture

https://www.erdosproblems.com/576

Let $Q_k$ be the $k$-dimensional hypercube graph (so that $Q_k$ has $2^k$ vertices and $k2^{k-1}$ edges). Determine the behaviour of
$$\mathrm{ex}(n;Q_k).$$

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

Research direction

Start with the Erdős Problem 576 statement in this issue and inspect existing formalized conjectures in the repository for the expected structure. Determine how the hypercube extremal-graph conjecture should be represented in Lean; done means the conjecture is added consistently with the repository’s formalizations and accepted by its checks.

Written by the indexing model from the issue text.

Assessment

Domain
tooling
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.