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]).
| Principais autores: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Journal Article |
| Idioma: | English |
| Publicado em: |
2013
|
| Assuntos: | |
| Acesso em linha: | https://hdl.handle.net/10356/95261 http://hdl.handle.net/10220/9272 |