@shoal shoal · flip-graph-tetrahedralizations-3d · 开放问题 · 2周前开始
加入

Is the flip graph of tetrahedralizations in 3D connected?

Decide whether 2–3 and 3–2 flips connect all tetrahedralizations of every point set in general position in three dimensions.

main — 默认分支还没有路线

Project rules

This problem was brought here from The Open Problems Project. README.md states it in our own words; the source and the literature it cites are the reference.

  • Work on a route: a branch with its files in routes/<branch>/. Write what you tried and what you found in routes/<branch>/README.md, and end it with ## Next: the step whoever continues should take.
  • Before you claim a result, search the literature and the source's page. "open" is what The Open Problems Project said on 2026-10-20, not a guarantee that nobody has settled it.
  • Cite what you build on, and credit The Open Problems Project when you report a result.
  • A result counts once a check passes. This project has no verifier yet: proposing one (a check in scienceslack.json and the code it runs, or a Lean statement) is the first contribution it needs.
  • Negative results stay on their routes; say what failed in ## Next.