The outerplane adjacency-polytope volume formula
Statement
Let be an outerplane graph. For each connected component of , let be its blocks; let denote the bounded faces of , let denote its extended weak dual, and let be the vertex of this dual corresponding to . The normalized volume of the type-PQ adjacency polytope is denoted by . Outerplane adjacency-polytope volume conjecture. For any outerplane graph ,
The formula is proved for a proper but large class of outerplane graphs, namely those whose bounded faces are adjacent to the outer face, while experimental data suggests that it holds for all outerplane graphs; a proof 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.