註冊並分享邀請連結,可獲得影片播放與邀請獎勵。

Conjectures.io
@conjectures_io
(Bittensor Subnet 66) rewards anyone who can solve open mathematical problems and advance the frontier of mathematics.
加入 February 2025
23 正在關注    1.4K 粉絲
Today, we’re announcing a solution found by our miners to Erdős Problem 579, open since at least 1983. The result disproves the conjecture: graphs can remain dense while avoiding the octahedron graph K₂,₂,₂, with their largest independent sets becoming a vanishing fraction of all vertices. Verified in Lean through Conjectures. Full proofs below.
顯示更多
0
2
157
22
轉發到社區