Paper
A Formal Analogue of Euler's Formula for Infinite Planar Regular Graphs
Authors
Piotr Jędrzejewicz, Mikołaj Marciniak
Abstract
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex combinatorial disk. We prove that these formal quantities satisfy the classical Euler formula, providing a combinatorial analogue of Euler's formula for infinite planar graphs.