On a generalization of Kelly's combinatorial lemma

被引：3

作者：

Ben Amira, Aymen ^{[1
]}

Dammak, Jamel ^{[1
]}

Si Kaddour, Hamza ^{[2
]}

机构：

[1] Fac Sci Sfax, Dept Math, Sfax, Tunisia

[2] Univ Lyon 1, Dept Math, ICJ, F-69622 Villeurbanne, France

来源：

TURKISH JOURNAL OF MATHEMATICS | 2014年 / 38卷 / 06期

关键词：

Set; matrix; graph; tournament; isomorphism; INCIDENCE MATRICES; BINARY RELATIONS; ISOMORPHIC TYPES; RESTRICTIONS; TOURNAMENTS; GRAPHS; HEREDITARY; RECONSTRUCTION; HYPOMORPHY; N-1;

D O I：

10.3906/mat-1302-13

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：949 / 964

页数：16

共 36 条

[21] A CERTAIN CLASS OF INCIDENCE MATRICES [J].