Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. A short proof of Sperner's Lemma;Lubell;J. Combinatorial Theory,1966
2. A simple proof of the Erdös-Chao Ko-Rado theorem;Katona;J. Combinatorial Theory, A,1972
3. A. Ehrenfeucht and J. Mycielski (to appear).
4. On generalized graphs;Bollobás;Acta Math. Acad. Sci. Hungar.,1965
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Variations on the Bollobás set-pair theorem;European Journal of Combinatorics;2024-08
2. Inclusion Matrices for Rainbow Subsets;Bulletin of the Iranian Mathematical Society;2023-12-13
3. Intersecting families without unique shadow;Combinatorics, Probability and Computing;2023-10-02
4. Intersecting families with sunflower shadows;Acta Mathematica Hungarica;2022-10
5. Bollobás-type theorems for hemi-bundled two families;European Journal of Combinatorics;2022-02