ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b2(n)b_2(n) denote the minimum cardinality of an odd cover of the complete graph on nn vertices. Let k≥2k\ge2 be an integer satisfying k≡2,3(mod4)k\equiv2,3\pmod4.

Buchanan et al.'s conjecture. For such kk,

b2(2k)=k+1.b_2(2k)=k+1.

This conjecture specifies the remaining asserted values in the even-order case of the odd-cover problem and was confirmed independently by Buchanan et al. and by Leader and Tan.

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.