All Questions

For positive integers $n,k$ and $s$, where $0\le s<k$ and $k \le n$, we define the generalized Kneser graph $K(n,k,s)$ as follows: The vertices of $K(n,k,s)$ are the $k$-subsets of $[2n]$, i.e., we ...

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 ...