After 80 Years, Mathematicians Give Famed ‘Erdős Method’ an Upgrade

·Quanta Magazine··

In 1947, Paul Erdős, the itinerant Hungarian mathematician, introduced what would become one of math’s most powerful tools. He wanted to prove that a certain kind of object existed — in this case, a network made of interconnected nodes. But strangely, his proof didn’t specify how to build it. Instead, he showed that if you consider all networks and select one at random, the chances that you’ll… Source

Read full article →

Related Articles

US–Indian space mission maps extreme subsidence in Mexico City
leopoldj · Hacker News · 3mo ago
Why are neural networks and cryptographic ciphers so similar? (2025)
jxmorris12 · Hacker News · 3mo ago
Fun with polynomials and linear algebra; or, slight abstract nonsense
LolWolf · Hacker News · 3mo ago
The gauge broke: devs felt 20% faster with AI, measured 19% slower
intrepidkarthi · Hacker News · 1mo ago
OpenAI's claimed disproof of Connes' Rigidity Conjecture is invalid [pdf]
muglug · Hacker News · 8d ago