Avoiding brooms, forks, and butterflies in the linear lattices (Q781522): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4552141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Sperner's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest family without \(A \cup B \subseteq C \cap D\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding rank-preserving copies of a poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Matching in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diamond-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the size of diamond-free families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact forbidden subposet results using chain decompositions of the cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subposet problems with size restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forbidden poset problems in the linear lattice / rank
 
Normal rank

Revision as of 02:40, 23 July 2024

scientific article
Language Label Description Also known as
English
Avoiding brooms, forks, and butterflies in the linear lattices
scientific article

    Statements

    Avoiding brooms, forks, and butterflies in the linear lattices (English)
    0 references
    0 references
    0 references
    0 references
    17 July 2020
    0 references
    linear lattices
    0 references
    subspace lattices
    0 references
    normalized matching
    0 references
    forbidden poset
    0 references
    extremal combinatorics
    0 references
    fork
    0 references
    broom
    0 references
    butterfly
    0 references
    bowtie
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references