Production matrices and enumeration of geometric graphs

Abstract

We propose the study of counting problems for geometric graphs defined on point sets in convex position. Many formulae are known, for instance the numbers of triangulations are given by the Catalan numbers. Our approach to that topic is based on generating trees, production matrices, and Riordan arrays. We aim to derive such formulae with the mentioned tools, and also to prove new formulae for the numbers of geometric graphs, as well as relations among them.