The Hamiltonicity conjecture for the wiggly flip graph

At least 1 year old · documented by

Let WFGn\mathrm{WFG}_n be the wiggly flip graph. Hamiltonicity conjecture. The wiggly flip graph WFGn\mathrm{WFG}_n admits a Hamiltonian path, or even a Hamiltonian cycle. The authors checked this conjecture computationally for n≤3n\leq 3. Its validity for general nn remains open.

References

Primary source

Asilata Bapat and Vincent Pilaud, “Wigglyhedra”, arXiv:2407.11632 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.