Advertisement

Infinite Combinatorics and Graphs

  • John M. Harris
  • Jeffry L. Hirst
  • Michael J. Mossinghoff
Chapter
Part of the Undergraduate Texts in Mathematics book series (UTM)

Abstract

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

Keywords

Regular Cardinal Peano Arithmetic Incompleteness Theorem Pigeonhole Principle Marriage 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • John M. Harris
    • 1
  • Jeffry L. Hirst
    • 2
  • Michael J. Mossinghoff
    • 3
  1. 1.Department of MathematicsFurman UniversityGreenvilleUSA
  2. 2.Mathematical Sciences, Appalachian State UniversityBooneUSA
  3. 3.Department of MathematicsDavidson CollegeDavidsonUSA

Personalised recommendations