Paired coalition number conjecture for complete binary trees
Statement
Let denote a complete binary tree with height , and let denote its paired coalition number.
Complete binary tree conjecture.
This conjecture gives the proposed paired coalition number for every complete binary tree. The preceding argument establishes the value for ; the general assertion remains unresolved in the supplied text.
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.