Abstract
Some mathematical principles, such as the two in the title of this chapter, are so obvious that you might think they would only produce equally obvious results. To convince you that “It ain’t necessarily so” we illustrate them with examples that were suggested by Paul Erdős to be included in The Book. We will encounter instances of them also in later chapters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. E. J. Brouwer: Über Abbildungen von Mannigfaltigkeiten, Math. An-nalen 71 (1912), 97–115.
W. G. Brown: On graphs that do not contain a Thomsen graph, Canadian Math. Bull. 9 (1966), 281–285.
P. Erdős, A. RÉnyi & V. SÉs: On a problem of graph theory, Studia Sci. Math. Hungar. 1 (1966), 215–235.
P. Erdős & G. Szekeres: A combinatorial problem in geometry, Compositio Math. (1935), 463-470.
S. HoŞten & W. D. Morris: The order dimension of the complete graph, Discrete Math. 201 (1999), 133–139.
I. Reiman: Über ein Problem von K. Zarankiewicz, Acta Math. Acad. Sci. Hungar. 9 (1958), 269–273.
J. Spencer: Minimal scrambling sets of simple orders, Acta Math. Acad. Sci. Hungar. 22 (1971), 349–353.
E. Sperner: Neuer Beweis für die Invarianz der Dimensions zahl und des Gebietes, Abh. Math. Sem. Hamburg 6 (1928), 265–272.
W. T. Trotter: Combinatorics and Partially Ordered Sets: Dimension Theory, John Hopkins University Press, Baltimore and London 1992.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2001). Pigeon-hole and double counting. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04315-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-662-04315-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04317-2
Online ISBN: 978-3-662-04315-8
eBook Packages: Springer Book Archive