previous up next
Go backward to Example
Go up to Top
Go forward to Parents and Children
RISC-Linz logo

Trees and Cycles

Proposition: A tree has only cycles of length 0:

forall T: T is tree =>
  ~(exists p: p is path in T /\  length(p) > 0 /\  p is cycle).

No (non-trivial) path in a tree is a cycle.

Author: Wolfgang Schreiner
Last Modification: January 26, 2000

previous up next