Veselovac's stackability conjecture for complete binary trees
Statement
Let be the complete binary tree with depth .
Veselovac's conjecture. The tree is stackable for all .
This conjecture was verified by Veselovac for , and for the root vertex only when ; the general case remains open.
Record
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.