A note on homomorphisms of Kneser hypergraphs

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

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

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 and its (hyper) edges are formed by the r-tuples of pairwise disjoint k-subsets of the set . In this paper, we give conditions for the existence of homomorphisms between uniform Kneser hypergraphs.
Original languageEnglish
Article number124764
JournalApplied Mathematics and Computation
Volume366
DOIs
Publication statusPublished - Feb 2020

    Fingerprint

Keywords

  • kneser hypergraph
  • hypergraph homomorphism
  • hypergraph coloring

Cite this