Eventual uniqueness of maximum independent sets in monomial graphs
Statement
For positive integers and nonnegative integers , let be the graph whose vertices are the monomials of degree in variables, with two monomials adjacent exactly when their least common multiple has degree . Let denote the number of maximum independent sets of . Eventual uniqueness conjecture. For any , there exists some such that whenever and .
The conjecture extends the paper's established uniqueness results in selected cases, particularly for with divisible by and for with even. It predicts eventual uniqueness along the multiples of the number of variables for every .
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.