A connected graph with no cycles. Equivalently, n vertices and n−1 edges. Spanning trees underlie MST algorithms (Prim, Kruskal).
Tree (graph-theoretic)
Related concepts
- Graph G = (V, E)
- Cycle
- Spanning tree
- Spline interpolation (piecewise polynomial)
- Free magma (non-associative)
- Automorphic representations (Langlands)
- LDPC + Turbo codes
- Proof nets (Girard / linear-logic)
- Calculus of constructions
- Inductive type (W-type)
- Universe hierarchy (Russell)
- Branching process (Galton-Watson)
- Tangent bundle TM
- Principal fiber bundle
- Sheaf on manifold
- Ordinal analysis (Bachmann hierarchy)
- Realizability (Kleene 1945)
- Langlands program (foundational)
- Simplicial complex + CW
- Ultraproduct construction (Los theorem)