Effective constructibility of planar Cayley graphs
Statement
Let be a general planar presentation, let denote its Cayley graph, and let . Effective constructibility conjecture. There is an algorithm that, given and , outputs the ball of radius in . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.