A combinatorial bijection between linear extensions of equivalent orders (Q1078213): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Jiří Rosický / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jiří Rosický / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dimension of Finite and Infinite Comparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Decomposition of Graphs and Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability invariance of the fixed point property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered sets and their comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered structures and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dimension of a Comparability Graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:57, 17 June 2024

scientific article
Language Label Description Also known as
English
A combinatorial bijection between linear extensions of equivalent orders
scientific article

    Statements

    A combinatorial bijection between linear extensions of equivalent orders (English)
    0 references
    0 references
    0 references
    1986
    0 references
    For posets P and Q with the same comparability graph, there is constructed a bijection between the sets of linear extensions of P and Q such that the number of setups is preserved.
    0 references
    0 references
    posets
    0 references
    comparability graph
    0 references
    linear extensions
    0 references