Larrión–Neumann-Lara–Pizaña conjecture on clique divergence of non-negative Euler characteristic surfaces

Let GG be a locally cyclic graph of minimum degree δ4\delta\ge 4 triangulating a closed surface of Euler characteristic χ0\chi\ge 0; equivalently, the surface is a sphere, projective plane, torus or Klein bottle. A graph is clique divergent if its clique dynamics does not eventually cycle. Larrión–Neumann-Lara–Pizaña's conjecture. The graph GG is clique divergent. This conjecture asks whether every such triangulation has divergent clique dynamics; the paper presents it as an open question and attributes it to Larrión, Neumann-Lara and Pizaña.

Sources & referencesView supporting material

Primary source

Anna M. Limbach and Martin Winter, “Characterising Clique Convergence for Locally Cyclic Graphs of Minimum Degree δ6”, arXiv:2305.00503 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.