Dénombrement des ordres étagés

DOI10.1016/0012-365X(85)90137-2MaRDI QIDQ762485zbMATH OpenFDO

Authors Germain Kreweras

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

recurrence relationnumber of bipartite graphstiered order relation

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• The number of tiered posets modulo six
• On recursion relations in the problem of enumeration of posets
• Counting interval orders
• Maximal chains of preorders
• On the number of two-point antichains in the powerset of an \(n\)-element set ordered by inclusion

Cites work

• scientific article; zbMATH DE number 3327333 (Why is no real title available?)
• A Machine Representation of Finite T ₀ Topologies
• The number of graded partially ordered sets

Cited in

(4)

• Counting finite posets and topologies
• The number of hierarchical orderings
• scientific article; zbMATH DE number 3860380 (Why is no real title available?)
• The number of tiered posets modulo six

This page was built for publication: Dénombrement des ordres étagés

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762485)