Cameron–Mol conjecture comparing complete-join and complete-bipartite graphs
Statement
Let and be positive integers. Write for the disjoint union of a complete graph on vertices and isolated vertices, and let be the complete bipartite graph with parts of sizes and . Cameron–Mol's conjecture. If is sufficiently larger than , then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.