Infinite Combinatorics and Graphs
Part of the Undergraduate Texts in Mathematics book series (UTM)
Infinite sets are very peculiar, and remarkably different from finite sets. This can be illustrated with a combinatorial example.
KeywordsPeano 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.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 2000