The Explicit Graphs Are Subcubic
Lax920634.SubcubicConstruction · concepts/Lax920634/SubcubicConstruction.lean · lax-920634
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
Every member of the specified zig-zag and path-replacement family is subcubic. A port has at most two neighbors inside its path and one neighbor across the regular graph's edge involution.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax920634.ZigZagConstruction |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The Explicit Graphs Are Subcubic |
| 6 | type: lemma |
| 7 | --- |
| 8 | Every member of the specified zig-zag and path-replacement family is |
| 9 | subcubic. A port has at most two neighbors inside its path and one neighbor |
| 10 | across the regular graph's edge involution. |
| 11 | |
| 12 | # Formalization notes |
| 13 | |
| 14 | The statement concerns the precise executable construction on `Fin (order k)`. |
| 15 | Self-loops and coincident edges are removed by the simple graph definition. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax920634.SubcubicConstruction |
| 19 | |
| 20 | open ZigZagConstruction EdgeExpansion |
| 21 | |
| 22 | /-- The specified deterministic family has maximum degree at most three. -/ |
| 23 | axiom subcubic (k : ℕ) : IsSubcubic (graph k) |
| 24 | |
| 25 | end Lax920634.SubcubicConstruction |
| 26 |
Formalization notes
The statement concerns the precise executable construction on . Self-loops and coincident edges are removed by the simple graph definition.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments