par Cara, Philippe 
;Lehman, Serge ;Pasechnik, Dimitrii D.V.
Référence Theoretical computer science, 263, 1-2, page (31-35)
Publication Publié, 2001
;Lehman, Serge ;Pasechnik, Dimitrii D.V.Référence Theoretical computer science, 263, 1-2, page (31-35)
Publication Publié, 2001
Article révisé par les pairs
| Résumé : | The number of inductively minimal geometries is counted for any given rank. The counting exhibits correspondence between the inductively minimal of rank n and the trees with n + 1 vertices. The correspondence is proven by using the van Rooij-Wilf characterization of the graphs. |
