ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm and nn be positive integers. Write Km+nK1K_m+nK_1 for the disjoint union of a complete graph on mm vertices and nn isolated vertices, and let Km,nK_{m,n} be the complete bipartite graph with parts of sizes mm and nn. Cameron–Mol's conjecture. If nn is sufficiently larger than mm, then

μ(Km+nK1)<μ(Km,n).\mu(K_m+nK_1)<\mu(K_{m,n}).

The source presents this as a conjecture of Cameron and Mol; no resolution is supplied in the provided 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.