On recurrence relation in the problem of enumeration of finite posets
From MaRDI portal
(Redirected from Publication:515207)
Recommendations
Cites work
- scientific article; zbMATH DE number 202575 (Why is no real title available?)
- scientific article; zbMATH DE number 3245121 (Why is no real title available?)
- A Machine Representation of Finite T 0 Topologies
- Counting finite posets and topologies
- Number of labeled topologies on ten points
- On enumeration of posets defined on finite set
- On the Number of Topologies on A Finite Set
- On the computer enumeration of finite topologies
- On the enumeration of finite topologies
- Posets on up to 16 points
- Some recurrence relations in finite topologies
- Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
- The number of labelled topologies on nine points
- \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
Cited in
(7)- On recursion relations in the problem of enumeration of posets
- On support sets of acyclic and transitive digraphs
- scientific article; zbMATH DE number 822736 (Why is no real title available?)
- On enumeration of posets defined on finite set
- The number of partially ordered sets with more points than incomparable pairs
- Edges in the poset of partitions of an integer
- On some formulas in the problem of enumeration of finite labeled topologies
This page was built for publication: On recurrence relation in the problem of enumeration of finite posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515207)
