ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a non-acyclic graph, with a fixed-point-free involution μ:V→V\mu:V\to V and, for every vertex vv, a bijection σv:δ(v)→δ(μ(v))\sigma_v:\delta(v)\to\delta(\mu(v)). Assume that λ(v,μ(v))=deg⁡(v)\lambda(v,\mu(v))=\deg(v) and σμ(v)=σv−1\sigma_{\mu(v)}=\sigma_v^{-1}. Tiling conjecture. There exists a nonempty list of cycles of GG such that, for every pair of edges ee and ff incident with a vertex vv, the number of listed cycles containing both ee and ff equals the number containing both σv(e)\sigma_v(e) and σv(f)\sigma_v(f). If GG 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 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.