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

共 38 条

[31] Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem
Hujdurovic, Ademir
Husic, Edin
Milanic, Martin
Rizzi, Romeo
Tomescu, Alexandru, I
ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (02)
[32] A Turan-type generalization of Tuza's triangle edge cover problem
Borg, Peter
Fenech, Kurt
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2020, 78 : 399 - 412
[33] PRIMARY CHILDREN'S RECOGNITION AND USE OF ISOMORPHIC STRUCTURES IN SOLVING COMBINATORIAL COUNTING PROBLEMS
Hoeveler, Karina
Winzen, Janet
INTERNATIONAL SYMPOSIUM ELEMENTARY MATHEMATICS TEACHING: BROADENING EXPERIENCES IN ELEMENTARY SCHOOL MATHEMATICS, 2021, : 202 - 211
[34] PARTIAL LEAST SQUARES MODELLING FOR IMAGING-GENETICS IN ALZHEIMER'S DISEASE: PLAUSIBILITY AND GENERALIZATION
Lorenzi, Marco
Gutman, Boris
Hibar, Derrek P.
Altmann, Andre
Jahanshad, Neda
Thompson, Paul M.
Ourselin, Sebastien
2016 IEEE 13TH INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI), 2016, : 838 - 841
[35] A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation
Jones, Morgan
Peet, Matthew M.
AUTOMATICA, 2021, 127
[36] A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
Flandrin, Evelyne
Li, Hao
Marczyk, Antoni
Wozniak, Mariusz
DISCRETE MATHEMATICS, 2007, 307 (7-8) : 878 - 884
[37] Using graphical adaptive lasso approach to construct transcription factor and microRNA's combinatorial regulatory network in breast cancer
Su, Naifang
Dai, Ding
Deng, Chao
Qian, Minping
Deng, Minghua
IET SYSTEMS BIOLOGY, 2014, 8 (03) : 87 - 95
[38] Computer-Oriented Representations of Oh-Skeletons for Supporting Combinatorial Enunieration by Fujita's Proligand Method. GAP Calculation of Cycle Indices with Chirality Fittingness (CI-CFs)
Fujita, Shinsaku
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2017, 77 (02) : 409 - 442

← 1 2 3 4 →