注册并分享邀请链接,可获得视频播放与邀请奖励。

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
转发到社区