Buchanan–odd-cover conjecture for complete graphs
Statement
For a graph , let denote its biclique partition number over the field of two elements, and let denote the complete graph on vertices. Let be a positive integer. Buchanan–odd-cover conjecture.
and
whenever or . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.