Abstract
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 language | English |
|---|---|
| Article number | 124764 |
| Journal | Applied Mathematics and Computation |
| Volume | 366 |
| DOIs | |
| Publication status | Published - Feb 2020 |
Keywords
- kneser hypergraph
- hypergraph homomorphism
- hypergraph coloring
Fingerprint
Dive into the research topics of 'A note on homomorphisms of Kneser hypergraphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver