





















Kauffman's clock theorem provides a distributive lattice structure on the set of states of a four-valent graph in the plane. We prove two distinct generalisations of this theorem, for four-valent graphs embedded in more general compact oriented surfaces. The proofs use results of Propp providing distributive lattice structures on matchings on bipartite plane graphs, and orientations of graphs with fixed circulation.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。