ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, let Ec(Kn)\mathcal{E}_{c}(K_n) denote its complete expansion graph, and let pn(G)pn(G) be the pagenumber of a graph GG. For a positive integer mm, set n=2m+1n=2m+1. The pagenumber conjecture.

pn(Ec(Kn))=⌈n2⌉.pn(\mathcal{E}_{c}(K_n))=\left\lceil\frac{n}{2}\right\rceil.

The preceding theorem gives lower and upper bounds differing by one for odd nn; the equality is known when m=2m=2, equivalently for Ec(K5)\mathcal{E}_{c}(K_5), but 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 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.