Advertisement

Intersection Graphs of Rectangles and Segments

  • R. Ahlswede
  • I. Karapetyan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4123)

Abstract

Let F be a finite family of sets and G(F) be the intersection graph of F (the vertices of G(F) are the sets of family F and the edges of G(F) correspond to intersecting pairs of sets). The transversal number τ(F) is the minimum number of points meeting all sets of F. The independent (stability) number α(F) is the maximum number of pairwise disjoint sets in F. The clique number ω(F) is the maximum number of pairwise intersecting sets in F. The coloring number q(F) is the minimum number of classes in a partition of F into pairwise disjoint sets.

Keywords

Discrete Math Chromatic Number Combinatorial Problem Intersection Graph Coloring Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Gýarfás, A., Lehel, J.: Covering and coloring problems for relatives of intervals. Discrete Math. 55, 167–180 (1985)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Károlyi, G.: On point covers of parallel rectangles. Periodica Mathematica Hungarica 23(2), 105–107 (1991)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Fon-Der-Flaass, D.G., Kostochka, A.V.: Covering boxes by points. Discrete Math. 120, 269–275 (1993)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Asplund, E., Grünbaum, B.: On a coloring problem. Math. Scand. 8, 181–188 (1960)MATHMathSciNetGoogle Scholar
  5. 5.
    Burling, J.: On coloring problems of families of prototypes, Ph.D. Thesis, University of Colorado Boulder, CO (1965)Google Scholar
  6. 6.
    Akiyama, J., Hosono, K., Urabe, H.: Some combinatorial problems. Discrete Math. 116, 291–298 (1993)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Perepelitsa, I.: The estimates of the chromatic number of the intersection graphs of figures on the plane (personal communication)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • R. Ahlswede
    • 1
  • I. Karapetyan
    • 2
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeldGermany
  2. 2. 

Personalised recommendations