graph-grafting
Installation
SKILL.md
Graph Grafting Skill
Trit: 0 (ERGODIC - Coordinator)
GF(3) Triad: queryable (-1) ⊗ graftable (0) ⊗ derangeable (+1) = 0
Overview
Combinatorial complex operations replacing GraphQL with pure graph theory:
| Operation | Trit | Description |
|---|---|---|
| Queryable | -1 | Tree-shape decision via bag decomposition |
| Colorable | 0 | GF(3) 3-coloring via sheaf |
| Derangeable | +1 | Permutations with no fixed points |
| Graftable | 0 | Attach rooted tree at vertex |
Mathematical Foundation
Grafting = attaching a rooted tree T at vertex v of graph G: