Pigeonhole Principles

Chapter

Abstract

The pigeonhole principle asserts that there is no multi-valued total injective mapping from a set with m elements into a set with n elements, if m > n. The elements of the set of size m are traditionally called pigeons and the elements of the set of size n are called holes and so the pigeonhole principle can be stated more pictorially saying that

if m > n pigeons fly to n holes then (at least) two of them must go to the same hole.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Departament de Ciències de la ComputacióUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations