Conjecture on the k-coalition number of complete bipartite graphs
Statement
Let be the complete bipartite graph with part sizes and , where , and let denote the -coalition number of a graph . Complete bipartite graph coalition conjecture. For ,
The paper proves the lower bound and conjectures that this bound is attained. The equality remains unresolved in the supplied text.
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.