Dénombrement des ordres étagés

DOI10.1016/0012-365X(85)90137-2zbMATH Open0558.05004MaRDI QIDQ762485FDOQ762485

Authors: Germain Kreweras 

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

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

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)

Cites Work

• The number of graded partially ordered sets
• A Machine Representation of Finite T ₀ Topologies
• Title not available (Why is that?)

Cited In (4)

• Counting finite posets and topologies
• The number of hierarchical orderings
• Title not available (Why is that?)
• 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)