google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 1070

Open
#1,110 1 comment 0 reactions 0 assignees View on GitHub
ams-51: Geometry erdos-problems new conjecture
Dominant language
Lean
Stars
1.3k
Forks
485
Avg merge
2d 4h
Merged PRs (30d)
363

Description

### What is the conjecture

https://www.erdosproblems.com/1070

Let $f(n)$ be maximal such that, given any $n$ points in $\mathbb{R}^2$, there exist $f(n)$ points such that no two are distance $1$ apart. Estimate $f(n)$. In particular, is it true that $f(n)\geq n/4$?

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 by reading the conjecture and its open status at https://www.erdosproblems.com/1070, then inspect the formal-conjectures repository for comparable Erdős problem entries. Done means adding a Lean formalization of Problem 1070 to the collection.

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
Active
Clarity
Needs clarification
Newbie friendliness
45/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.