Enumerating orientations of ordered sets

DOI10.1016/0012-365X(91)90012-QMaRDI QIDQ803181zbMATH OpenFDO

Authors Weiping Liu, Ivan Rival

Publication date 1991

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

orientationsmatchingsindependent subsets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)

Recommendations

• Linear extensions of random orders
• scientific article; zbMATH DE number 4016962
• The number of linear extensions of subset ordering
• scientific article; zbMATH DE number 924935
• Graph orientations and linear extensions

Cites work

• scientific article; zbMATH DE number 3889587 (Why is no real title available?)
• scientific article; zbMATH DE number 3957181 (Why is no real title available?)
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Complexity of diagrams
• Inversions, cuts, and orientations
• On reorienting graphs by pushing down maximal vertices

Cited in

(11)

• The estimate of the number of permutationally-ordered sets
• Enumerating \(k\)-arc-connected orientations
• Oriented sets and even permutations: Asymmetry index series and \(q\)-series
• Enumerating orientations of the free spikes
• scientific article; zbMATH DE number 3841924 (Why is no real title available?)
• scientific article; zbMATH DE number 5800998 (Why is no real title available?)
• Every triangle-free planar graph has a planar upward drawing
• Orientations, semiorders, arrangements, and parking functions
• Obituary: Ivan Rival
• The number of hierarchical orderings
• A Knuth-Bendix-like ordering for orienting combinator equations

This page was built for publication: Enumerating orientations of ordered sets

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