ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P{\mathcal P} be a general planar presentation, let Cay⁡(P)\operatorname{Cay}({\mathcal P}) denote its Cayley graph, and let n∈Nn\in{\mathbb N}. Effective constructibility conjecture. There is an algorithm that, given P{\mathcal P} and nn, outputs the ball of radius nn in Cay⁡(P)\operatorname{Cay}({\mathcal P}). This would strengthen the effective-enumerability result for planar Cayley graphs; the source notes that the statement was proved in the cubic case, but does not establish it for general planar presentations.

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.