Abstract
The pigeonhole principle (also known as Dirichlet’s principle) states the “obvious” fact that n + 1 pigeons cannot sit in n holes so that every pigeon is alone in its hole. More generally, the pigeonhole principle states the following:
If a set consisting of more than kn objects is partitioned into n classes, then some class receives more than k objects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2001). The Pigeonhole Principle. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04650-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-04650-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08559-8
Online ISBN: 978-3-662-04650-0
eBook Packages: Springer Book Archive