Loading...

On Beck’s Coloring of Posets

Manochehri, Erfan | 2013

1129 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 47028 (02)
  4. University: Sharif University of Technology
  5. Department: Mathematical Sciences
  6. Advisor(s): Pournaki, Mohammad Reza
  7. Abstract:
  8. We study Beck-like coloring of partially ordered sets (posets) with a least element 0. To any poset P with 0 we assign a graph (called a zero-divisor graph) whose vertices are labelled by the elements of P with two vertices x, y adjacent if 0 is the only element lying below x and y. We prove that for such graphs, the chromatic number and the clique number coincide.Also, we give a condition under which posets are not finitely colorable
  9. Keywords:
  10. Graph Coloring ; Chromatic Number ; Clique Number ; Ideal ; Annihilator ; Partially Order Set

 Digital Object List