ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ks,tK_{s,t} be the complete bipartite graph with part sizes ss and tt, where s≤ts\leq t, and let Ck(G)C_k(G) denote the kk-coalition number of a graph GG. Complete bipartite graph coalition conjecture. For s≤ts\leq t,

Ck(Ks,t)=t−k+2.C_k(K_{s,t})=t-k+2.

The paper proves the lower bound Ck(Ks,t)≥t−k+2C_k(K_{s,t})\geq t-k+2 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 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.