Skip to main content

A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger’s Theorem

  • Chapter
  • First Online:
The Mathematics of Paul Erdős II
  • 1921 Accesses

Summary

We discuss a few issues concerning Erdős’ conjecture on the extension of Menger’s theorem to infinite graphs. A key role is given to a lemma to which the conjecture can probably be reduced. The paper is intended to be expository, so rather than claim completeness of proofs, we chose to prove the reduction only for graphs of size 1. We prove the lemma (and hence the 1 case of the conjecture) in two special cases: graphs with countable out-degrees, and graphs with no unending paths. We also present new versions of the proofs of the (already known) cases of countable graphs and graphs with no infinite paths. A main tool used is a transformation converting the graph into a bipartite graph.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Bibliography

  1. R. Aharoni. Menger’s theorem for graphs containing no infinite paths. European J. Combin., 4:201–204, 1983.

    MathSciNet  MATH  Google Scholar 

  2. R. Aharoni. Konig’s duality theorem for infinite bipartite graphs. J. London Math. Soc., 29:1–12, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Aharoni. Menger’s theorem for countable graphs. J. Combin. Th., ser. B, 43:303–313, 1987.

    Google Scholar 

  4. R. Aharoni. Linkability in countable-like webs. Cycles and rays, G. Hahn et al. ed., Nato ASI series, pages 1–8, 1990.

    Google Scholar 

  5. R. Aharoni and R. Diestel. Menger’s theorem for countable source sets. Comb., Pro and Camp., 3:145–156, 1994.

    Google Scholar 

  6. R. Aharoni, C. St. J. A. Nash-Williams, and S. Shelah. A general criterion for the existence of transversals. Proc. London Math. Soc., 47:43–68, 1983.

    Google Scholar 

  7. D. Kőnig. Theorie der Endlischen und unendlischen Graphen. Chelsea, New York, 1950.

    Google Scholar 

  8. K.-P Podewski and K.Steffens. Injective choice functions for countable families. J. Combin. Theory, ser.B, 21:40–46, 1976.

    Google Scholar 

  9. K.-P Podewski and K.Steffens. Uber Translationen und der Satz von Menger in unendlischen Graphen. Acta Math. Aca. Sci. Hungar., 30:69–84, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ron Aharoni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Aharoni, R. (2013). A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger’s Theorem. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős II. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7254-4_21

Download citation

Publish with us

Policies and ethics