The independence number conjecture for even Johnson-type graphs J_±(n,4,1)
Statement
Let be the Johnson-type graph with parameters , , and , and let denote the independence number of a graph . Independence number conjecture. Let be an even number. Then
This is posed as an open question about determining independence numbers of Johnson-type graphs; the source does not provide a proof or resolution for this parameter range.
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.