Author:
Holroyd Fred,Spencer Claire,Talbot John
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. The complete intersection theorem for systems of finite sets;Ahlswede;European J. Combin.,1997
2. C. Berge, Nombres de coloration de l’hypergraphe h-partie complet, Hypergraph Seminar, Columbus, Ohio 1972, Springer, New York, 1974, pp. 13–20.
3. An Erdős–Ko–Rado theorem for signed sets;Bollobás;Comput. Math. Appl.,1997
4. Maximum number of permutations with given minimal or maximal distance;Deza;J. Combin. Theory Ser. A,1977
5. Erdős–Ko–Rado theorem—22 years later;Deza;SIAM J. Algebric Discrete Methods,1983
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the star of the family of independent sets in a graph;Discrete Applied Mathematics;2024-02
2. On the Holroyd-Talbot conjecture for sparse graphs;Discrete Mathematics;2024-01
3. Very well-covered graphs with the
Erdős–Ko–Rado property;Involve, a Journal of Mathematics;2023-04-14
4. Strict Erdős-Ko-Rado for simplicial complexes;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. On intersecting families of independent sets in trees;Discrete Applied Mathematics;2022-11