A Nearest-Neighbor Hard-Core Model on a Penrose Graph

A. Mazel, I. Stuhl, Y. Suhov

We prove that the maximal graph-density of an independent set in a Penrose P3 tiling considered as a planar non-directed graph is equal to $(57-25\sqrt{5})/2\approx 0.54915$ de…