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]).

Saved in:

Bibliographic Details
Main Authors:	Cara, Philippe, Lehman, Serge, Pasechnik, Dmitrii V.
Other Authors:	School of Physical and Mathematical Sciences
Format:	Article
Language:	English
Published:	2013
Subjects:	DRNTU::Engineering::Computer science and engineering::Mathematics of computing
Online Access:	https://hdl.handle.net/10356/95261 http://hdl.handle.net/10220/9272
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University
Language:	English

id	sg-ntu-dr.10356-95261
record_format	dspace
spelling	sg-ntu-dr.10356-952612023-02-28T19:30:40Z On the number of inductively minimal geometries Cara, Philippe Lehman, Serge Pasechnik, Dmitrii V. School of Physical and Mathematical Sciences DRNTU::Engineering::Computer science and engineering::Mathematics of computing 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]). Accepted version 2013-02-27T03:45:07Z 2019-12-06T19:11:31Z 2013-02-27T03:45:07Z 2019-12-06T19:11:31Z 2001 2001 Journal Article Cara, P., Lehman, S., & Pasechnik, D. V. (2001). On the number of inductively minimal geometries. Theoretical Computer Science, 263(1-2), 31-35. 0304 3975 https://hdl.handle.net/10356/95261 http://hdl.handle.net/10220/9272 10.1016/S0304-3975(00)00228-0 en Theoretical computer science © 2001 Elsevier Science B.V. This is the author created version of a work that has been peer reviewed and accepted for publication by Theoretical Computer Science, Elsevier Science B.V. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: DOI[http://dx.doi.org/10.1016/S0304-3975(00)00228-0]. application/pdf
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
language	English
topic	DRNTU::Engineering::Computer science and engineering::Mathematics of computing
spellingShingle	DRNTU::Engineering::Computer science and engineering::Mathematics of computing Cara, Philippe Lehman, Serge Pasechnik, Dmitrii V. On the number of inductively minimal geometries
description	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]).
author2	School of Physical and Mathematical Sciences
author_facet	School of Physical and Mathematical Sciences Cara, Philippe Lehman, Serge Pasechnik, Dmitrii V.
format	Article
author	Cara, Philippe Lehman, Serge Pasechnik, Dmitrii V.
author_sort	Cara, Philippe
title	On the number of inductively minimal geometries
title_short	On the number of inductively minimal geometries
title_full	On the number of inductively minimal geometries
title_fullStr	On the number of inductively minimal geometries
title_full_unstemmed	On the number of inductively minimal geometries
title_sort	on the number of inductively minimal geometries
publishDate	2013
url	https://hdl.handle.net/10356/95261 http://hdl.handle.net/10220/9272
_version_	1759857586450989056

On the number of inductively minimal geometries

Similar Items