Author:
Erdős Péter L.,Frankl P.,Kleitman D. J.,Saks M. E.,Székely L. A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. G. C. Clements: A minimization problem concerning subsets of finite sets,Discrete Mathematics 4 (1973), 123–128.
2. D. E. Daykin, J. Godfrey, andA. J. W. Hilton: Existence theorems for Sperner families.J. Combinatorial Theory (A)17 (1974), 245–251.
3. C. Greene, andA. J. W. Hilton: Some results on Sperner families,J. Comb. Theory (A)26 (1979), 202–209.
4. G. O. H. Katona: A theorem of finite sets,Theory of graphs, Proc. Coll. Tihany, 1966, Akadémiai Kiadó, 1966, 187–207.
5. J. B. Kruskal: The number of simplices in a complex,Mathematical Optimization Techniques, Univ. of Calif. Press, Berkeley and Los Angeles (1963), 251–278.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Local LYM Identities;Annals of Combinatorics;2013-08-20
2. On Half-Way AZ-Style Identities;Graphs and Combinatorics;2011-04-22
3. Weighted cross-intersecting families;Discrete Mathematics;2008-06
4. An AZ-style identity and Bollobás deficiency;Journal of Combinatorial Theory, Series A;2007-11