Conjectures.io(@conjectures_io):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.

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 팬

Conjectures.io@conjectures_io

2026.10.06 15:41

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.