When do graph covers preserve the clique dynamics of infinite graphs?
Abstract
We investigate for which classes of (potentially infinite) graphs the clique dynamics is cover stable, i. e., when clique convergence/divergence is preserved under triangular covering maps. We first present an instructive counterexample: a clique convergent graph which covers a clique divergent graph and which is covered by a clique divergent graph. Based on this we then focus on local conditions (i. e., conditions on the neighbourhoods of vertices) and show that the following are sufficient to imply cover stability: local girth ≥ 7 and local minimum degree ≥ 2; being locally cyclic and of minimum degree ≥ 6.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.