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.

DOI

10.3906/mat-1302-13

Keywords

Set, matrix, graph, tournament, isomorphism

First Page

949

Last Page

964

Recommended Citation

AMIRA, A. B, DAMMAK, J, & KADDOUR, H. S (2014). On a generalization of Kelly's combinatorial lemma. Turkish Journal of Mathematics 38 (6): 949-964. https://doi.org/10.3906/mat-1302-13

Download