Skip to main content

Transversals of d-intervals — Comparing three Approaches

  • Conference paper
European Congress of Mathematics

Part of the book series: Progress in Mathematics ((PM,volume 169))

Abstract

In this short note we compare three different methods for solving the same combinatorial problem. We start by describing the problem itself.

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

Access this chapter

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, Piercing d-intervals, to appear in Discrete Comput. Geom.

    Google Scholar 

  2. N. Alon and D. J. Kleitman, Piercing convex sets and the Hadwiger Debrunner (p, q)-problem, Advences in Mathematics 96 (1992), 103–112.

    Article  MathSciNet  MATH  Google Scholar 

  3. Z. Füredi, Maximum degree and fractional matchings in uniform hypergraphs, Com-binatorica 1, 2 (1981), 155–162.

    MATH  Google Scholar 

  4. A. Gyárfás and J. Lehel, A Helly-type problem in trees, in Combinatorial Theory and its Applications, P. Erdös, A. Ré nyi and V. T. Sös, Eds., North-Holland, Amsterdam 1970, 571–584.

    Google Scholar 

  5. A. Hajnal and J. Surányi, Über die Auflösung von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest (1958), 113–121.

    Google Scholar 

  6. T. Kaiser, Transversals of d-intervals, to appear in Discrete Comput. Geom.

    Google Scholar 

  7. T. Kaiser and Y. Rabinovich, Intersection properties of families of convex (n,d) bodies, to appear in Discrete Comput. Geom.

    Google Scholar 

  8. Gy. Károlyi and G. Tardos, On point covers of multiple intervals and axis-parallel rectangles, Combinatorica, 16(2) (1996) 213–222.

    Article  MathSciNet  MATH  Google Scholar 

  9. L. Lovász, Minimax theorems for hypergraphs, in Hypergraph Seminar 1972 (C. Berge and D.K. Ray-Chaudhuri eds.), Lecture Notes 411, Springer-Verlag, Berlin, 1972.

    Google Scholar 

  10. E. A. Ramos, Equipartition of mass distributions by hyperplanes, Discrete Comput. Geom. 15 (1996) 147–167.

    Article  MathSciNet  MATH  Google Scholar 

  11. E. H. Spanier, Algebraic Topology, McGraw-Hill, 1966.

    Google Scholar 

  12. G. Tardos, Transversals of 2-intervals, a topological approach, Combinatorica 15, 1 (1995), 123–134.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Basel AG

About this paper

Cite this paper

Tardos, G. (1998). Transversals of d-intervals — Comparing three Approaches. In: Balog, A., Katona, G.O.H., Recski, A., Sza’sz, D. (eds) European Congress of Mathematics. Progress in Mathematics, vol 169. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8898-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8898-1_15

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9819-5

  • Online ISBN: 978-3-0348-8898-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics