On recurrence relation in the problem of enumeration of finite posets
From MaRDI portal
Publication:515207
DOI10.17377/SEMI.2017.14.011zbMATH Open1357.05061MaRDI QIDQ515207FDOQ515207
Authors: Vitaliĭ Ivanovich Rodionov 
Publication date: 13 March 2017
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Recommendations
Cites Work
- On the computer enumeration of finite topologies
- Counting finite posets and topologies
- \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
- Title not available (Why is that?)
- The number of labelled topologies on nine points
- Number of labeled topologies on ten points
- On the enumeration of finite topologies
- Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
- On enumeration of posets defined on finite set
- A Machine Representation of Finite T 0 Topologies
- On the Number of Topologies on A Finite Set
- Title not available (Why is that?)
- Posets on up to 16 points
- Some recurrence relations in finite topologies
Cited In (7)
- On support sets of acyclic and transitive digraphs
- On enumeration of posets defined on finite set
- The number of partially ordered sets with more points than incomparable pairs
- On some formulas in the problem of enumeration of finite labeled topologies
- On recursion relations in the problem of enumeration of posets
- Title not available (Why is that?)
- Edges in the poset of partitions of an integer
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)
