Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs

We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation θ ∈ Sym(V) such that the sets E, Eθ, Eθ2, . ....

Full description

Bibliographic Details
Published in:Discussiones Mathematicae Graph Theory
Main Authors: Dilbarjot, Gosselin Shonda Dueck
Format: Article
Language:English
Published: University of Zielona Góra 2022-08-01
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2303