ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P4\mathbb{P}_4 be the prefix-reversal graph on the permutations of {1,2,3,4}\{1,2,3,4\}, and let γ(P4)\gamma(\mathbb{P}_4) denote its orientable genus. A graph is a pretzel graph if it admits the corresponding pretzel-graph embedding. Pretzel-graph conjecture. The graph P4\mathbb{P}_4 is a pretzel graph, and

γ(P4)=3.\gamma(\mathbb{P}_4)=3.

The authors report that the displayed rotation system has eight regions and indicate that this is likely the maximum number of regions obtainable from any rotation system, but they did not attempt all possible vertex labelings. Thus the claimed exact genus remains open in the supplied source.

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.