Skip to main content

Infinite Combinatorics and Graphs

  • Chapter
  • 1951 Accesses

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

Abstract

Infinite sets are very peculiar, and remarkably different from finite sets. This can be illustrated with a combinatorial example.

...the definitive clarification of the natur of the infinite has become necessary...

David Hilbert [84]

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Harris, J.M., Hirst, J.L., Mossinghoff, M.J. (2000). Infinite Combinatorics and Graphs. In: Combinatorics and Graph Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4803-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4803-1_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-4805-5

  • Online ISBN: 978-1-4757-4803-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics