Abstract

Let n, k, r be positive integers, with n ≥ kr. The r-uniform Kneser hypergraph KGr(n, k) has as vertex set the set of all k-subsets of the set {1,…,n} and its (hyper) edges are formed by the r-tuples of pairwise disjoint k-subsets of the set {1,…,n}. In this paper, we give conditions for the existence of homomorphisms between uniform Kneser hypergraphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call