scientific article; zbMATH DE number 125494

From MaRDI portal
Publication:4027196





[For the entire collection see Zbl 0748.00023.] Using the definition of \(k\)-free, a known result can be re-stated as follows: If \(G\) is not edge-reconstructible then \(G\) is \(k\)-free, for all even \(k\). It is known that trees are edge-reconstructible; but an alternative proof of this can be obtained by combining the result above with the result outlined here that, apart from paths, all trees (except a finite number, which are determined) are not 2-free. The approach may be of use in obtaining further results on edge-reconstruction.











This page was built for publication:

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