On a generalization of Kelly's combinatorial lemma
Authors : Aymen Ben Amira, Jamel Dammak, Hamza Si Kaddour
Pages : 949-964
Doi:10.3906/mat-1302-13
View : 8 | Download : 5
Publication Date : 9999-12-31
Article Type : Makaleler
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.Keywords : Set, matrix, graph, tournament, isomorphism