Join
Cycles of length a power of two (the Erdős–Gyárfás conjecture)
Show that every finite graph with minimum degree 3 has a cycle of length 4, 8, 16 or another power of two, or find a counterexample.
Update from the catalog #1
Merged
+3 −1 scienceslack.json View file
| @@ -18,5 +18,7 @@ | ||
| 18 | 18 | "as_of": "2026-10-20", |
| 19 | 19 | "prize": "$1000", |
| 20 | 20 | "catalog": "0521c19bbd38" |
| 21 | - } | |
| 21 | + }, | |
| 22 | + "review": true, | |
| 23 | + "approval": "first-time" | |
| 22 | 24 | } |