Buchanan et al.'s even-order conjecture for odd covers

From papers

Let b2(n)b_2(n) denote the minimum cardinality of an odd cover of the complete graph on nn vertices. Let k2k\ge2 be an integer satisfying k2,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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ting Huang, Jiabao Yang and Yaojun Chen, “Odd covers for complete graphs and complete 3-graphs”, arXiv:2607.07448 (2026).

Solutions 0

No solutions have been posted yet.