Local routing-or-grid alternative
Lax17.LocalRoutingOrGrid · concepts/Lax17/LocalRoutingOrGrid.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
In one strong cluster, large equal terminal sets either admit the desired local routing or force the target grid minor.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax17.GridMinor |
| 2 | import Lax17.PathOfSets |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Local routing-or-grid alternative |
| 7 | type: theorem |
| 8 | --- |
| 9 | In one strong cluster, large equal terminal sets either admit the desired |
| 10 | local routing or force the target grid minor. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax17.LocalRoutingOrGrid |
| 14 | |
| 15 | universe u |
| 16 | |
| 17 | /-- In one connected cluster, large linked terminal sets either force an |
| 18 | `h × h` grid minor or admit `q` disjoint routes with pairwise bridges. -/ |
| 19 | axiom localRoutingOrGrid : |
| 20 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 21 | (G : SimpleGraph V) {C A B : Finset V} {h q w : ℕ}, |
| 22 | 1 < h → |
| 23 | 1 < q → |
| 24 | Lax17.PathOfSets.IsCluster G C → |
| 25 | Lax17.Linkedness.NodeLinkedIn G C A B → |
| 26 | A.card = w → |
| 27 | B.card = w → |
| 28 | (16 * h + 10) * q ≤ w → |
| 29 | Lax17.GridMinor.ContainsGridMinor G h ∨ |
| 30 | ∃ Q : Lax17.Paths.VertexLinkage G A B q, |
| 31 | (∀ i : Fin q, (Q.path i).StaysIn C) ∧ |
| 32 | Q.HasPairwiseBridgesIn C |
| 33 | |
| 34 | end Lax17.LocalRoutingOrGrid |
| 35 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments