3-uniform hypergraphs: modular decomposition and realization by tournaments
Combinatorics
2018-05-15 v1
Abstract
Let be a 3-uniform hypergraph. A tournament defined on is a realization of if the edges of are exactly the 3-element subsets of that induce 3-cycles. We characterize the 3-uniform hypergraphs that admit realizations by using a suitable modular decomposition.
Keywords
Cite
@article{arxiv.1805.04607,
title = {3-uniform hypergraphs: modular decomposition and realization by tournaments},
author = {Abderrahim Boussaïri and Brahim Chergui and Pierre Ille and Mohamed Zaidi},
journal= {arXiv preprint arXiv:1805.04607},
year = {2018}
}