On a generalization of Kelly's combinatorial lemma

DOI10.3906/MAT-1302-13MaRDI QIDQ5175547zbMATH OpenOpenAlexWikidataFDO

Authors Aymen Ben Amira, Jamel Dammak, Hamza Si Kaddour

Publication date 24 February 2015

Published in Turkish Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.4249, https://dergipark.org.tr/tr/pub/tbtkmath/issue/12277/146573

zbMATH Keywords

isomorphismmatrixtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

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.

Recommendations

• The converse of Kelly's lemma and control-classes in graph reconstruction
• On the Nash-Williams' lemma in graph reconstruction theory
• Graph reconstruction from subgraphs
• scientific article; zbMATH DE number 772776
• On Kelly's lemma for infinite sets of integers

Cited in

(6)

• On the generalized iterates of Yeh's combinatorial \({\mathbb{K}}\)-species
• On Kelly's lemma for infinite sets of integers
• Equality of graphs up to complementation
• scientific article; zbMATH DE number 1921361 (Why is no real title available?)
• On the number of edges of a graph and its complement
• Kelly's conjecture

This page was built for publication: On a generalization of Kelly's combinatorial lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175547)