{
  "id": "1402.5739",
  "version": "v1",
  "published": "2014-02-24T07:43:24.000Z",
  "updated": "2014-02-24T07:43:24.000Z",
  "title": "The chromatic number of comparability 3-hypergraphs",
  "authors": [
    "Natalia Garcia-Colin",
    "Amanda Montejano",
    "Deborah Oliveros"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-02-24T07:43:24.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "chromatic number",
      "comparability simple graph",
      "perfect graph",
      "clique number",
      "relationship"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.5739G"
    }
  }
}