How many comparisons are needed to determine a linear order of the Boolean poset
Statement
Fishburn, Pekec, Reeds: How many comparisons are needed to determine a linear order of the Boolean poset? That is, what is the fewest number of questions of the form "Is S < T?" must one ask in order to find out a linear ordering of all subsets of an n-set? Conjecture: n-1.
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.