The pagenumber conjecture for complete expansion graphs
Statement
Let be the complete graph on vertices, let denote its complete expansion graph, and let be the pagenumber of a graph . For a positive integer , set . The pagenumber conjecture.
The preceding theorem gives lower and upper bounds differing by one for odd ; the equality is known when , equivalently for , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.