zbMATH — the first resource for mathematics

A new generalization of the Erdős-Ko-Rado theorem. (English) Zbl 0529.05001

05A05 Permutations, words, matrices
05C65 Hypergraphs
05C35 Extremal problems in graph theory
Full Text: DOI
[1] B. Bollobás, Three-graphs without two triples whose symmetric difference is contained in a third,Discrete Math. 8 (1974) 21–24. · Zbl 0291.05114 · doi:10.1016/0012-365X(74)90105-8
[2] P. Erdos, Problems and results in graph theory and combinatorial analysis,Proc. Fifth British Comb. Conf. 1975, Aberdeen 1975 (Utilitas Math. Winnipeg (1976), 169–172.
[3] P. Erdos, On the number of complete subgraphs contained in a certain graphs,Publ. Math. Inst. of the Hungar. Acad. Sci. (Ser A) 7 (1962) 459–464. · Zbl 0116.01202
[4] P. Erdos, C. Ko andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (Ser. 2) 12 (1961) 313–320. · Zbl 0100.01902 · doi:10.1093/qmath/12.1.313
[5] P. Frankl, On Sperner families satisfying an additional condition.J. Combinatorial Th. A 20 (1976) 1–11. · Zbl 0328.05002 · doi:10.1016/0097-3165(76)90073-X
[6] P. Frankl, On a problem of Chvátal and Erdos,J. Combinatorial Th. A, to appear.
[7] P. Frankl, On families of finite sets no two of which intersect in a singleton,Bull. Austral. Math. Soc. 17 (1977) 125–134. · Zbl 0385.05003 · doi:10.1017/S0004972700025521
[8] P. Frankl, A general intersection theorem for finite sets,Proc. of French-Canadian Combinatorial Coll., Montreal 1979, Annals of Discrete Math. 8 (1980), to appear.
[9] A. J. W. Hilton andE. C. Milner, Some intersection theorems for systems of finite sets,Quart J. Math. Oxford (2)18 (1967) 369–384. · Zbl 0168.26205 · doi:10.1093/qmath/18.1.369
[10] P. Turán, An extremal problem in graph theory,Mat. Fiz. Lapok 48 (1941) 436–452 (in Hungarian).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.