Author:
Frankl Peter,Füredi Zoltán
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. B. Bollobás, Three-graphs without two triples whose symmetric difference is contained in a third,Discrete Math. 8 (1974) 21–24.
2. P. Erdős, 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. Erdős, 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.
4. P. Erdős, C. Ko andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (Ser. 2) 12 (1961) 313–320.
5. P. Frankl, On Sperner families satisfying an additional condition.J. Combinatorial Th. A 20 (1976) 1–11.
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献