BitsExplorer

BitsExplorer finds what people are building with AI, every day. See today's picks →

Preview of FKSEdgeThreshold

FKSEdgeThreshold

Lean 4 proof of Frankl-Kupavskii-Swanepoel Theorem 3: for d >= 4, every finite graph with fewer than C(d+2,2) edges has a unit-distance representation in R^d, and K_{d+2} does not

Description excerpted from the original listing, which is linked below.

Open it Source code

The week in AI-built software

Every Monday: how many projects were built with AI that week, which tools built them, where they came from, and the week's picks.

Read the latest week