BitsExplorer

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

Preview of Erdos 1016 Pancyclic

Erdos 1016 Pancyclic

Erdős Problem #1016: AI agents determine h(n)=6 for 41≤n≤67 (minimal pancyclic graphs); Lean proofs, GPU search, claim files and a one-page paper

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