Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length

A complete \(3\)-uniform hypergraph of order \(n\) has vertex set \(V\) with \(|V|=n\) and the set of all \(3\)-subsets of \(V\) as its edge set. A \(t\)-cycle in this hypergraph is \(v_1, e_1, v_2, e_2,\dots, v_t, e_t, v_1\) where \(v_1, v_2,\dots, v_t\) are distinct vertices and \(e_1, e_2,\dots,...

Full description

Bibliographic Details
Main Authors: R. Lakshmi, T. Poovaragavan
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2020-07-01
Series:Opuscula Mathematica
Subjects:
Online Access:https://www.opuscula.agh.edu.pl/vol40/4/art/opuscula_math_4028.pdf