arXiv Analytics

Sign in

arXiv:1402.5739 [math.CO]AbstractReferencesReviewsResources

The chromatic number of comparability 3-hypergraphs

Natalia Garcia-Colin, Amanda Montejano, Deborah Oliveros

Published 2014-02-24Version 1

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.

Related articles: Most relevant | Search more
arXiv:math/0208072 [math.CO] (Published 2002-08-09, updated 2003-11-24)
Topological lower bounds for the chromatic number: A hierarchy
arXiv:0903.3048 [math.CO] (Published 2009-03-17)
Biclique Coverings and the Chromatic Number
arXiv:1409.2922 [math.CO] (Published 2014-09-09)
Trees, ladders and graphs