Abstract
Inequalities are presented for systems {(A i ,B i ):1 ≤ i ≤ m} of pairs of finite sets satisfyingA i ∩ B i =∅ andA i ∩ B j ≠ ∅ orA j ∩ B i ≠ ∅ fori ≠ j.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon, N., Kalai, G.: A simple proof of the upper bound theorem. Europ. J. Comb.6, 211–214 (1985)
Alspach, B., Ollmann, O.T., Reid, K.B.: Mutually disjoint families of 0–1 sequences. Discrete Math.12, 205–209 (1975)
Bollobás, B.: On generalized graphs. Acta Math. Acad. Sci. Hung.16, 447–452 (1965)
Frankl, P.: An extremal problem for two families of sets. Europ. J. Comb.3, 125–127 (1982)
Füredi, Z., Tuza, Zs.: Hypergraphs without a large star. Discrete Math.55, 317–321 (1985)
Kalai, G.: Intersection patterns of convex sets. Isr. J. Math.48, 161–174 (1984)
Katona, G.O.H., Szemerédi, E.: On a problem of graph theory. Stud. Sci. Math. Hung.2, 23–28 (1967)
Perles, M.A.: At most 2d+1 neighborly simplices in Ed. Ann. Discrete Math.20, 253–254 (1984)
Pin, E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math.17, 535–548 (1983)
Tarján, T.G.: Complexity of lattice-configurations. Stud. Sci. Math. Hung.10, 203–211 (1975)
Tuza, Zs.: Helly-type hypergraphs and Sperner families. Europ J. Comb.5, 185–187 (1984)
Tuza, Zs.: Critical hypergraphs and intersecting set-pair systems. J. Comb. Theory (B)39, 134–145 (1985)
Tuza, Zs.: Intersection properties and extremal problems for set systems (to appear)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tuza, Z. Inequalities for two set systems with prescribed intersections. Graphs and Combinatorics 3, 75–80 (1987). https://doi.org/10.1007/BF01788531
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788531