Hamiltonian face-lattice conjecture
Statement
For every convex polytope of dimension , let be its face lattice and let be its cover graph: the vertices are the faces of , and two faces and are adjacent exactly when one covers the other in , equivalently when and (or conversely). The conjecture asserts that has a Hamiltonian cycle, i.e. a cycle containing every face of exactly once.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.