加入
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.
+22 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,22 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "mathematics", | |
| 3 | + "topics": [ | |
| 4 | + "graph-theory" | |
| 5 | + ], | |
| 6 | + "type": "construction", | |
| 7 | + "also": [ | |
| 8 | + "proof" | |
| 9 | + ], | |
| 10 | + "source": { | |
| 11 | + "key": "erdos", | |
| 12 | + "name": "Erdős Problems", | |
| 13 | + "url": "https://www.erdosproblems.com/64", | |
| 14 | + "id": "64", | |
| 15 | + "curator": "Thomas Bloom", | |
| 16 | + "poser": "Paul Erdős and András Gyárfás", | |
| 17 | + "status": "open, $1000 prize", | |
| 18 | + "as_of": "2026-10-20", | |
| 19 | + "prize": "$1000", | |
| 20 | + "catalog": "0521c19bbd38" | |
| 21 | + } | |
| 22 | +} | |