The supertoken graph independence-number conjecture for bipartite graphs
Statement
Let be a bipartite graph with independent sets and , with , as in Theorem. Let be the -supertoken graph of , and suppose that . The supertoken graph independence-number conjecture. The independence number of attains the upper bound in. The claim is motivated by computer evidence in the case ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.