Counting crucial permutations with respect to monotone patterns (Q6117352): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On uniquely \(k\)-determined permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On five types of crucial permutations with respect to monotone patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crucial words and the complexity of some extremal problems for sets of prohibited words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hook Graphs of the Symmetric Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations, matrices, and generalized Young tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erd\H{o}s--Hajnal analogue for permutation classes / rank
 
Normal rank

Revision as of 10:07, 27 August 2024

scientific article; zbMATH DE number 7806390
Language Label Description Also known as
English
Counting crucial permutations with respect to monotone patterns
scientific article; zbMATH DE number 7806390

    Statements

    Identifiers