Combinatorial tiling conjecture for paired non-acyclic graphs
Statement
Let be a non-acyclic graph, with a fixed-point-free involution and, for every vertex , a bijection . Assume that and . Tiling conjecture. There exists a nonempty list of cycles of such that, for every pair of edges and incident with a vertex , the number of listed cycles containing both and equals the number containing both and . If has a connected component with at least four vertices, the list may moreover be required to contain a cycle of length greater than two. This is the combinatorial restatement of the paper’s tiling conjecture and is intended to provide the graph-theoretic structure needed for polygonal surface constructions.
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.