A Brylawski decomposition for finite ordered sets
From MaRDI portal
Publication:2558873
Cites work
Cited in
(11)- On the computational complexity of the order polynomial
- The Redei function of a relation
- The Tutte-Grothendieck group of an alphabetic rewriting system
- Representation functions and the Neggers-Stanley condition for weight-shaped-posets
- Acyclic orientations of graphs. (Reprint)
- Acyclic orientations of graphs
- The Tutte-Grothendieck ring
- Doppelgangers: the ur-operation and posets of bounded height (extended abstract)
- Binomial Enumeration on Dissects
- Combinatorial reciprocity theorems
- Set maps, umbral calculus, and the chromatic polynomial
This page was built for publication: A Brylawski decomposition for finite ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558873)