On recursion relations in the problem of enumeration of posets
From MaRDI portal
Publication:2306042
DOI10.33048/semi.2020.17.014zbMath1436.05050OpenAlexW3018794876MaRDI QIDQ2306042
Publication date: 20 March 2020
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2020.17.014
Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On recurrence relation in the problem of enumeration of finite posets
- Posets on up to 16 points
- Obtainable sizes of topologies on finite sets
- The number of labelled topologies on nine points
- Number of labeled topologies on ten points
- On the enumeration of finite topologies
- Counting finite posets and topologies
- On the number of labeled acyclic digraphs
- Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
- On enumeration of posets defined on finite set
- The graph of partial orders
- FINITE TOPOLOGIES AND DIGRAPHS
- A Machine Representation of Finite T 0 Topologies
- The graph of reflexive-transitive relations and the graph of finite topologies
- Classification of topologies on finite sets using graphs
- On support sets of acyclic and transitive digraphs
- Enumerations of Finite Topologies Associated with a Finite Simple Graph
- The graph of acyclic digraphs
- On the Number of Topologies on A Finite Set
- On the computer enumeration of finite topologies
This page was built for publication: On recursion relations in the problem of enumeration of posets