A combinatorial lemma on the cartesian product of finite sets
DOI:
https://doi.org/10.1285/i15900932v13n2p291Abstract
A sufficient condition for the cartesian product of a finite family of equipotent finite sets to have elements without repetitions is given, and some application is discussed.Downloads
Published
01-01-1993
Issue
Section
Articoli
License
Authors who publish with this publication accept all the terms and conditions of the Creative Commons license at the link below.
Gli autori che pubblicano in questa rivista accettano i termini e le condizioni specificate nella licenza Creative Commons di cui al link sottostante.
http://creativecommons.org/licenses/by-nc-nd/3.0/it/legalcode
