Reconstruction of Binary Relations from their Restrictions of Cardinality 2, 3, 4 and (n - 1) I
暂无分享,去创建一个
We prove that any binary relation with underlying set (base) E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2. 3,4 and ( n 1). In part I we characterize relations R and R' on the same base E such that R / X and R ' / X arc isomorphic for every subset X of E with cardinality 2, 3,4. In part I1 we shall prove that R and R' arc isomorphic as soon as n > 6 when R / X and R/X' arc isomorphic for every subset X of E with cardinality 2. 3, 4 and ( n 1). 1991 MSC: 04A05
[1] Gérard Lopez,et al. L'Indeformabilite des Relations et Multirelations Binaires , 1978, Math. Log. Q..
[2] Paul K. Stockmeyer. A census of non-reconstructable digraphs, I: Six related families , 1981, J. Comb. Theory, Ser. B.
[3] Paul K. Stockmeyer. The falsity of the reconstruction conjecture for tournaments , 1977, J. Graph Theory.