Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. J. Eckhoff, Intersection properties of boxes. I. An upper-bound theorem, Israel Journal of Mathematics 62 (1988), 283–301.
2. J. Eckhoff, The maximum number of triangles in a K 4-free graph, Discrete Mathematics 194 (1999), 95–106.
3. J. Eckhoff, A new Turán-type theorem for cliques in graphs, Discrete Mathematics 282 (2004), 113–122.
4. P. Frankl, Z. Füredi and G. Kalai, Shadows of colored complexes, Mathematica Scandinavica 63 (1988), 169–178.
5. G. Katona, A theorem of finite sets, in Theory of Graphs, Academic Press, New York, 1968, pp. 187–207.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献