(≤k)-reconstructible binary relations - Université de La Réunion Access content directly
Journal Articles European Journal of Combinatorics Year : 2013

(≤k)-reconstructible binary relations


Abstract A relation R is ( ≤ k ) -reconstructible ( k a positive integer) if it is isomorphic with any relation S on the same vertex set with the property that the relations induced by R and S on any set of at most k vertices are isomorphic; it is ( ≤ k ) -self dual if every restriction to at most k vertices is self dual, i.e.  isomorphic to its dual relation (the relation obtained by reversing its arcs). In particular, relying on the description of ( ≤ k ) -self dual binary relations, we characterize, for each k ≥ 4 , all ( ≤ k ) -reconstructible binary relations: A binary relation is ( ≤ k ) -reconstructible if and only if its modules that are chains are finite and its ( ≤ k ) -self dual modules are self dual.

Dates and versions

hal-01186137 , version 1 (24-08-2015)



Youssef Boudabbous, Christian Delhommé. (≤k)-reconstructible binary relations. European Journal of Combinatorics, 2013, 37, pp.43 - 67. ⟨10.1016/j.ejc.2013.07.010⟩. ⟨hal-01186137⟩
163 View
0 Download



Gmail Mastodon Facebook X LinkedIn More