All Questions
1 question
1
vote
1
answer
80
views
Variant of Kneser hypergraph with elements appearing more than once
A Kneser hypergraph is a hypergraph with the vertices being the subsets of $M=\{1,2,\dots,m\}$ of size $l$ and the edges being the collections of size $r$ of these subsets such that any two subsets ...
- 277