A note on homomorphisms of Kneser hypergraphs

Flavia Bonomo-Braberman, Mitre C. Dourado, Mario Valencia-Pabon and Juan C. Vera

Applied Mathematics and Computation, 2020, vol. 366, issue C

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.

Keywords: Kneser hypergraph; Hypergraph homomorphism; Hypergraph coloring (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319307568
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:366:y:2020:i:c:s0096300319307568

DOI: 10.1016/j.amc.2019.124764

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().