On a generalization of Kelly''s combinatorial lemma | Zendy

Aymen Ben Amira | Zendy; Jamel Dammak | Zendy; Hamza Si Kaddour | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On a generalization of Kelly''s combinatorial lemma

Author(s) -

Aymen Ben Amira,

Jamel Dammak,

Hamza Si Kaddour

Publication year - 2014

Publication title -

turkish journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.454

H-Index - 27

eISSN - 1303-6149

pISSN - 1300-0098

DOI - 10.3906/mat-1302-13

Subject(s) - mathematics , generalization , lemma (botany) , modulo , combinatorics , conjecture , prime (order theory) , element (criminal law) , set (abstract data type) , discrete mathematics , computer science , mathematical analysis , ecology , poaceae , political science , law , biology , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research