General exact upper-bound conjecture for cliques on surfaces
Statement
Let be a surface with Euler characteristic , let be the largest integer such that embeds in , and let be a graph embeddable in . Write for the number of vertices of .
General exact upper-bound conjecture. Every graph embeddable in has at most
cliques, with equality if and only if triangulates and is obtained from by repeatedly splitting triangles.
The preceding bound is reported to fail for several surfaces without complete-graph triangulations, motivating this formulation in terms of the Euler characteristic. The conjecture gives the proposed exact extremal value for all surfaces.
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.