Skip to main content
SpringerLink
Log in

Intersection Graphs of Rectangles and Segments

  • Chapter
Book cover General Theory of Information Transfer and Combinatorics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gýarfás, A., Lehel, J.: Covering and coloring problems for relatives of intervals. Discrete Math. 55, 167–180 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Károlyi, G.: On point covers of parallel rectangles. Periodica Mathematica Hungarica 23(2), 105–107 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Fon-Der-Flaass, D.G., Kostochka, A.V.: Covering boxes by points. Discrete Math. 120, 269–275 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Asplund, E., Grünbaum, B.: On a coloring problem. Math. Scand. 8, 181–188 (1960)

    MATH  MathSciNet  Google Scholar 

  5. Burling, J.: On coloring problems of families of prototypes, Ph.D. Thesis, University of Colorado Boulder, CO (1965)

    Google Scholar 

  6. Akiyama, J., Hosono, K., Urabe, H.: Some combinatorial problems. Discrete Math. 116, 291–298 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Perepelitsa, I.: The estimates of the chromatic number of the intersection graphs of figures on the plane (personal communication)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    R. Ahlswede

  2.  

    I. Karapetyan

Authors
  1. R. Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Karapetyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, 100131, 33501, Bielefeld, Germany

    Rudolf Ahlswede

  2. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Lars Bäumer , Ning Cai , Harout Aydinian  & Christian Deppe , ,  & 

  3. Russian Academy of Sciences Institute of Problems of Information Transmission, Bol’shoi Karetnyi per. 19, 101447, Moscow, Russia

    Vladimir Blinovsky

  4. Universität Bielefeld, Fakultät für Mathematik, Universitätsstr. 25, 33615, Bielefeld, Germany

    Haik Mashurian

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ahlswede, R., Karapetyan, I. (2006). Intersection Graphs of Rectangles and Segments. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_68

Download citation

  • DOI: https://doi.org/10.1007/11889342_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46244-6

  • Online ISBN: 978-3-540-46245-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation