On recurrence relation in the problem of enumeration of finite posets

DOI10.17377/semi.2017.14.011zbMath1357.05061MaRDI QIDQ515207

Vitaliĭ Ivanovich Rodionov

Publication date: 13 March 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

posetfinite topologygraph enumeration

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (3)

On some formulas in the problem of enumeration of finite labeled topologies ⋮ On support sets of acyclic and transitive digraphs ⋮ On recursion relations in the problem of enumeration of posets

Cites Work

• Unnamed Item
• Unnamed Item
• \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
• Posets on up to 16 points
• Some recurrence relations in finite topologies
• 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
• Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
• On enumeration of posets defined on finite set
• A Machine Representation of Finite T ₀ Topologies
• On the Number of Topologies on A Finite Set
• On the computer enumeration of finite topologies

This page was built for publication: On recurrence relation in the problem of enumeration of finite posets