The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence
Abstract
We present a new, explicit and very geometric construction for the iterated clique graphs of the hexagonal lattice Hex which makes apparent its clique-divergence and sheds light on some previous observations, such as the boundedness of the degrees and clique sizes of kn Hex as n∞.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.