ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let b2(G)b_2(G) denote its biclique partition number over the field of two elements, and let KnK_n denote the complete graph on nn vertices. Let kk be a positive integer. Buchanan–odd-cover conjecture.

b2(K2k+1)=k+1,b_2(K_{2k+1})=k+1,

and

b2(K2k)=k+1b_2(K_{2k})=k+1

whenever k≡2(mod4)k\equiv 2 \pmod{4} or k≡3(mod4)k\equiv 3 \pmod{4}. This extends the known values for complete graphs in the odd-cover problem; the conjecture remains open in the supplied source.

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.