Author:
Przykucki Michał,Roberts Alexander
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Maximally connected arrays on the n-cube;Bernstein;SIAM J. Appl. Math.,1967
2. Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability;Bollobás,1986
3. On the stability of the Erdős-Ko-Rado theorem;Bollobás;J. Comb. Theory, Ser. A,2016
4. On “stability” in the Erdős-Ko-Rado theorem;Devlin;SIAM J. Discrete Math.,2016
5. Intersecting families are essentially contained in juntas;Dinur;Comb. Probab. Comput.,2009
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimising the total number of subsets and supersets;European Journal of Combinatorics;2024-05
2. Isoperimetric stability in lattices;Proceedings of the American Mathematical Society;2023-09-26
3. Hypercontractivity for global functions and sharp thresholds;Journal of the American Mathematical Society;2023-07-18
4. Isoperimetric stability in lattices;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Edge Isoperimetric Inequalities for Powers of the Hypercube;The Electronic Journal of Combinatorics;2022-03-11