ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Σ\Sigma be a surface with Euler characteristic χ\chi, let ω\omega be the largest integer such that KωK_\omega embeds in Σ\Sigma, and let GG be a graph embeddable in Σ\Sigma. Write ∣V(G)∣|V(G)| for the number of vertices of GG.

General exact upper-bound conjecture. Every graph GG embeddable in Σ\Sigma has at most

8∣V(G)∣−4(7+49−24χ)+2(7+49−24χ)/28|V(G)|-4(7+\sqrt{49-24\chi})+2^{(7+\sqrt{49-24\chi})/2}

cliques, with equality if and only if KωK_\omega triangulates Σ\Sigma and GG is obtained from KωK_\omega by repeatedly splitting triangles.

The preceding bound 8(∣V(G)∣−ω)+2ω8(|V(G)|-\omega)+2^\omega 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 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.