The converse of Kelly’s lemma and control-classes in graph reconstruction
We prove a converse of the well-known Kelly’s Lemma. This motivates the introduction of the general notions of -table, -congruence and control-class.
We prove a converse of the well-known Kelly’s Lemma. This motivates the introduction of the general notions of -table, -congruence and control-class.
Page 1