ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers nn and nonnegative integers dd, let Gn(d)G_n(d) be the graph whose vertices are the monomials of degree dd in nn variables, with two monomials adjacent exactly when their least common multiple has degree d+1d+1. Let an(d)\mathbf{a}_n(d) denote the number of maximum independent sets of Gn(d)G_n(d). Eventual uniqueness conjecture. For any n≥1n \geq 1, there exists some N≥0N \geq 0 such that an(d)=1\mathbf{a}_n(d)=1 whenever d≡0(modn)d\equiv 0\pmod n and d≥Nd\geq N.

The conjecture extends the paper's established uniqueness results in selected cases, particularly for n=3n=3 with dd divisible by 33 and for n=4n=4 with dd even. It predicts eventual uniqueness along the multiples of the number of variables for every nn.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.