Inequalities for two set systems with prescribed intersections (Q1090680): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A simple proof of the upper bound theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutually disjoint families of 0-1 sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs without a large star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helly-type hypergraphs and Sperner families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical hypergraphs and interesting set-pair systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750908 / rank
 
Normal rank

Latest revision as of 10:28, 18 June 2024

scientific article
Language Label Description Also known as
English
Inequalities for two set systems with prescribed intersections
scientific article

    Statements

    Inequalities for two set systems with prescribed intersections (English)
    0 references
    1987
    0 references
    Es werden Ungleichungen für Systeme von Paaren endlicher Mengen der Form \(\{(A_ i,B_ i):\) \(1\leq i\leq m\}\) angegeben, die die Beziehungen \(A_ i\cap B_ i=\emptyset\) und \(A_ i\emptyset B_ j\neq \emptyset\) oder \(A_ j\cap B_ i\neq \emptyset\) für \(i\neq j\) erfüllen. Dabei werden diese Ungleichungen mit Rücksicht auf die Anzahl der einzelnen beteiligten Mengen abgeleitet. Die Arbeit gibt auch Verallgemeinerungen einiger aus der Literatur bekannten Ergebnisse an.
    0 references
    0 references
    inequalities
    0 references
    pairs of finite sets
    0 references
    0 references

    Identifiers