A note on homomorphisms of Kneser hypergraphs

Flavia Bonomo*, Mitre C. Dourado, Mario Valencia-pabon, J.C. Vera

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review


Let n, k, r be positive integers, with n ≥ kr. The r-uniform Kneser hypergraph KG r(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.

Original languageEnglish
Article number124764
JournalApplied Mathematics and Computation
Publication statusPublished - Feb 2020


  • kneser hypergraph
  • hypergraph homomorphism
  • hypergraph coloring


Dive into the research topics of 'A note on homomorphisms of Kneser hypergraphs'. Together they form a unique fingerprint.

Cite this