On the number of inductively minimal geometries

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.SCOPUS: ar.jinfo:eu-repo/semantics/publishe

On the number of inductively minimal geometries

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.SCOPUS: ar.jinfo:eu-repo/semantics/publishe

On the number of Inductively Minimal Geometries

We count the number of inductively minimal geometries for any given rank by exhibiting a correspondence between the inductively minimal geometries of rank n and the trees with n + 1 vertices. The proof of this correspondence uses the van Rooij-Wilf characterization of line graphs (see [11])