Infinite Combinatorics and Graphs

  • John M. Harris
  • Jeffry L. Hirst
  • Michael J. Mossinghoff
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

Peano Arithmetic Incompleteness Theorem Pigeonhole Principle Infinite Graph Separation Axiom 
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 New York 2000

Authors and Affiliations

  • John M. Harris
    • 1
  • Jeffry L. Hirst
    • 2
  • Michael J. Mossinghoff
    • 3
  1. 1.Department of MathematicsFurman UniversityGreenvilleUSA
  2. 2.Department of MathematicsAppalachian State UniversityBooneUSA
  3. 3.Department of MathematicsUCLALos AngelesUSA

Personalised recommendations