The clique graphs of the hexagonal lattice – an explicit construction and a short proof of divergence
share
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 k^n Hex as n→∞.
READ FULL TEXT