ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b2(G)b_2(G) denote the minimum dimension of a binary vector space in which the vertices of a graph GG can be represented as an odd cover, and let KmK_m be the complete graph on mm vertices. Odd-clique conjecture. For every integer n≥2n\geq 2,

b2(K2n−1)=n.b_2(K_{2n-1})=n.

The source already proves this equality when 2n−1≡±1(mod8)2n-1\equiv\pm1\pmod 8 and conjectures it also for the remaining odd residue classes 2n−1≡3,5(mod8)2n-1\equiv3,5\pmod 8. 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 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.