2026-04-17T07:59:50Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/1193722025-07-17T15:49:15Zcom_2072_1033col_2072_452951

00925njm 22002777a 4500 dc Esteban Pascual, Guillermo author 2018-07 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. Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria Combinatorial analysis Geometric graph Production matrix Riordan array Combinacions (Matemàtica) Classificació AMS::05 Combinatorics::05A Enumerative combinatorics Production matrices and enumeration of geometric graphs