Sigma clique covering growth conjecture for complete multipartite graphs
Statement
For positive integers and , let denote the complete -partite graph with each part of size . Let be a function and let be a constant.
Sigma clique covering growth conjecture. For every positive integers and , if , then
The conjecture would make the known upper bound for sharp up to a constant factor for sufficiently large . It is proved in the source for , while the general case remains open.
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.