Abstract
Some constructions of systems ofn-sets not containing Δ(k) systems are given. The constructions were produced by both analytical and computational methods.
Similar content being viewed by others
Literature
Abbott H.L.: Some Remarks on a Combinatorial Theorem of Erdös and Rado. Can. Math. Bull.9, 155–160 (1966)
Abbott H.L., Gardner B.: Remark on a Combinatorial Theorem of Erdös and Rado, in: W.T. Tutte, ed., Recent Progress in Combinatorics. (Academic Press, New York, 1969), 211–215
Abbott H.L., Hanson D.: On Finite Δ-Systems. Discrete Math.8, 1–12 (1972)
Abbott H.L., Hanson D: On Finite Δ-Systems II. Discrete Math.17, 121–126 (1977)
Abbott H.L., Hanson D. and Sauer N.: Intersection Theorems for Systems of Sets. J. Comb. Theory.12, 381–389 (1972)
Deza M.: Solution d'un problème de Erdös-Lovász. J. Comb. Theory (B)16, 166–167 (1974)
Erdös P., Szemerédi E: Combinatorial Properties of Systems of Sets. J. Comb. Theory (A)24, 308–313 (1978)
Erdös P., Rado R: Intersection Theorems for Systems of Sets. J. London Math. Soc.35, 85–90 (1960)
Spencer J.: Intersection Theorems for Systems of Sets. Can. Math. Bull20, 249–254 (1977)
Author information
Authors and Affiliations
Additional information
Research supported by Office of Naval Research Grant No. N0014-88-K0211.
Rights and permissions
About this article
Cite this article
Abbott, H.L., Exoo, G. On set systems not containing delta systems. Graphs and Combinatorics 8, 1–9 (1992). https://doi.org/10.1007/BF01271703
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01271703