Transitive oriented 3-Hypergraphs of cyclic orders
Combinatorics
2012-10-26 v1
Abstract
In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally extendable. Furthermore, we introduce the 3-hypergraph associated to a cyclic permutation and characterize it in terms of cyclic comparability 3-hypergraphs.
Keywords
Cite
@article{arxiv.1210.6828,
title = {Transitive oriented 3-Hypergraphs of cyclic orders},
author = {Natalia Garcia-Colin and Amanda Montejano and Luis Montejano and Deborah Oliveros},
journal= {arXiv preprint arXiv:1210.6828},
year = {2012}
}