REVIEW
Transitive oriented 3-Hypergraphs of cyclic orders
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Transitive oriented 3-Hypergraphs of cyclic orders
classification
math.CO
keywords
cyclichypergraphsdefinitionintroduceorderordersorientedpartial
read the original 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.