The odd-clique b2 conjecture for odd covers
Statement
Let denote the minimum dimension of a binary vector space in which the vertices of a graph can be represented as an odd cover, and let be the complete graph on vertices. Odd-clique conjecture. For every integer ,
The source already proves this equality when and conjectures it also for the remaining odd residue classes . Thus the conjectural content concerns those cases.
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.