No label defined (Q4027196)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 125494
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 125494

      Statements

      0 references
      0 references
      21 February 1993
      0 references
      trees
      0 references
      two-free trees
      0 references
      edge-reconstruction
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references