Delhi Time Travel
How to Time Travel in Delhi: an interactive map of fifteen monuments by distance from Raisina Hill and century founded
BitsExplorer finds what people are building with AI, every day. See today's picks →
Lean 4 proof of the dimension-five variants of Erdős problem 1007: the least edge count of a graph of dimension five is 15, attained by K₆ and K₁,₃,₃.
Description excerpted from the original listing, which is linked below.
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