ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bipartite graph with independent sets C1C_1 and C2C_2, with ∣C1∣=c1≤c2=∣C2∣|C_1|=c_1\leq c_2=|C_2|, as in Theorem. Let Fk(G){\mathcal F}_k(G) be the kk-supertoken graph of GG, and suppose that α(G)=∣C2∣\alpha(G)=|C_2|. The supertoken graph independence-number conjecture. The independence number of Fk(G){\mathcal F}_k(G) attains the upper bound in. The claim is motivated by computer evidence in the case α(G)=∣C2∣\alpha(G)=|C_2|; the source does not provide a proof or resolution.

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.