Research Communication | Open Access
Volume 2020 | Communication ID 224 |

An Algorithm for the Realization of 3-uniform Hypergraphs by tournaments

Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi
Academic Editor: Youssef EL FOUTAYENI
Received
Accepted
Published
03 February 2020
18 February 2020
10 March 2020

Abstract: Let H be a 3-uniform hypergraph. A tournament T defined on V(T)= V (H) is a realization of H if the edges of H are exactly the 3-element subsets of V(T) that induce 3-cycles. We characterize the 3-uniform hypergraphs that admit realizations by using a suitable modular decomposition.