On the size of jump-critical ordered sets (Q802585): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q71385563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00396268 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055962008 / rank
 
Normal rank

Latest revision as of 09:39, 30 July 2024

scientific article
Language Label Description Also known as
English
On the size of jump-critical ordered sets
scientific article

    Statements

    On the size of jump-critical ordered sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    The paper deals with a finite poset and its jump number which is the minimum number of jumps in its linear extensions. The result is that the size of a jump-critical ordered set with jump number m is at most \((m+1)!\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite poset
    0 references
    number of jumps
    0 references
    linear extensions
    0 references
    jump-critical ordered set
    0 references
    0 references
    0 references