The chromatic number of comparability 3-hypergraphs
classification
🧮 math.CO
keywords
comparabilityhypergraphnumberchromaticgraphhypergraphsorientedbeginning
read the original abstract
Beginning with the concepts of orientation for a 3-hypergraph and transitivity for an oriented 3-hypergraph, it is natural to study the class of comparability 3-hypergraphs (those that can be transitively oriented). In this work we show three different behaviors in respect to the relationship between the chromatic number and the clique number of a comparability 3-hypergraph, this is in contrast with the fact that a comparability simple graph is a perfect graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.