scientific article; zbMATH DE number 15259

From MaRDI portal
Publication:3977584





[For the entire collection see Zbl 0688.00003.] Posets parameters are studied, especially as how these parameters parallel commonly studied graph parameters. The main parameters considered are dimension, rank and irredundance. Given a poset \((X,P)\), a chain \((X,Q)\) is a linear extension of \((X,P)\) if \(P\subseteq Q\). A family \(F\) of linear extensions of a poset \((X,P)\) is a realizer of \((X,P)\) if \(\bigcap F=P\). The dimension \(\dim(P)\) and \(\text{rank}(P)\) are defined to be, respectively, the minimum and the maximum cardinality over all minimal realizers of \((X,P)\). A set \(L=\{(X,L_ 1),(X,L_ 2),\dots,(X,L_ n)\}\) of linear extensions is irredundant if for every \(i\), \(\bigcap_{j\neq i} L_ j-L_ i\neq\emptyset\). For a poset \((X,P)\) its irredundance number \(\text{ir}(P)\) and upper irredundance number \(IR(P)\) are defined to be, respectively, the minimum and the maximum cardinality over all maximal irredundant sets of linear extensions of \((X,P)\). The relation of parameters given above to domination and irredundance of graphs is treated. New results concerning irredundance in posets are given.











This page was built for publication:

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