Author:
Borujeni Seyed Hadi Afzali,Bowler Nathan
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference16 articles.
1. Anderson, I.: Combinatorics of Finite Sets. Clarendon Press, Oxford (1987)
2. Beck, M., Zaslavsky, T., Shorter, A: Simpler, stronger proof of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains. Journal of Combinatorial Theory, Series A 100, 196–199 (2002)
3. Beck, M., Wang, X., Zaslavsky, T.: A Unifying Generalization of Sperner’s Theorem. In: Gyõri, E., Katona, G.O.H., Lovasz, L. (eds.) More Sets, Graphs and Numbers: a Salute to Vera Sos and Andras Hajnal, In: Bolyai Soc. Math. Stud., vol. 15, pp 9–24. Springer, Janos Bolyai Mathematical Society, Berlin, Budapest (2006)
4. Bollobäs, B.: On generalized graphs. Acta Math. Acad. Sci. Hung. 16, 447–452 (1965)
5. Chudak, F., Griggs, J.R.: A new extension of Lubell’s inequality to the lattice of divisors. Stud. Sci. Math. Hung. 35, 347–351 (1999)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献