Journals / Turkish Journal of Mathematics / 2014 / Cilt: 38 - Sayı: 6

On a generalization of Kelly's combinatorial lemma

Pages
949–964
DOI
—

Abstract

Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t -elements subsets of a v -element set was given by Pouzet. We consider a version of this generalization modulo a prime p. We give illustrations to graphs and tournaments.

Özet

Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t -elements subsets of a v -element set was given by Pouzet. We consider a version of this generalization modulo a prime p. We give illustrations to graphs and tournaments.

Keywords: Set, matrix, graph, tournament, isomorphism

On a generalization of Kelly's combinatorial lemma — AJIndex