Let T0 (n, k) be the number of all labeled T0‐topologies having k open sets that we can
define on n points, and let t0 (n, k) be the number of those which are nonhomeomorphic. In …

In this paper, the number of neutrosophic topological spaces having two, three, and four
open sets are computed for a finite set XNT whose membership values lies in MNT. Further …

A Study on the Number of Neutrosophic Crisp Topological Spaces in a Finite Set Page 1
University of New Mexico Abstract. The computation of formulae for the number of topological …

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a
finite poset P. Then, using these numbers, we determine recursively and explicitly the …

We compute for the first time, the number of fuzzy topologies defined on a finite set and
having a small number of open sets. Certain cases, where the number of open sets is large …

In this paper, the number of neutrosophic topological spaces having two, three, and four
open setsare computed for a finite set XNT whose membership values lies in MNT. Further …

A structural framework is presented which allows the systematic determination of all non-
isomorphic posets on n points with at least τ⋅ 2 n downsets, or-equivalently-of all T 0 …

Among the unsolved problems of enumeration of graphs, one of the most difficult is the
problem of enumeration of transitive digraphs, which is equivalent to the problem of …

In two previous works of the author, published in this journal, a series of formulas are
obtained related to the themes of enumeration of partial orders (finite topologies). In the first …

Let $ X $ be a finite set, $ Z\subseteq X $ and $ y\notin X $. Marcel Ern\'{e} showed in 1981,
that the number of posets on $ X $ containing $ Z $ as an antichain equals the number of …