On a generalization of Kelly's combinatorial lemma
Combinatorics
2013-02-19 v1
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.
Cite
@article{arxiv.1302.4249,
title = {On a generalization of Kelly's combinatorial lemma},
author = {Aymen Ben Amira and Jamel Dammak and Hamza Si Kaddour},
journal= {arXiv preprint arXiv:1302.4249},
year = {2013}
}