×

An extremal problem for 3-graphs. (English) Zbl 0407.05013


MSC:

05A20 Combinatorial inequalities
05C35 Extremal problems in graph theory
05A05 Permutations, words, matrices
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] H. L. Abbott, D. Hanson, N. Sauer, Intersection theorems for systems of sets.J. Combin. Theory, A12 (1972), 381–389. · Zbl 0247.05004 · doi:10.1016/0097-3165(72)90103-3
[2] R. Duke, P. Erdos, Systems of finite sets having a common intersection, to appear.
[3] P. Erdos, C. Ko, R. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford, (2)12 (1961), 313–320. · Zbl 0100.01902 · doi:10.1093/qmath/12.1.313
[4] 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
[5] N. Sauer, The largest number of edges of graphs such that not more thang intersect in a point or more thann are independent, in: V. N. Welsh, ed.,Combinatorial Mathematics and its Applications, Academic Press (New York, 1971), 253–257.
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.