Lax17.StrongPathOfSetsContainsGrid
A grid minor from a strong path-of-sets system
concepts/Lax17/StrongPathOfSetsContainsGrid.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
A sufficiently long and wide strong path-of-sets system contains a prescribed square grid minor.
Lean source view on GitHub
| 1 | import Lax17.GridMinor |
| 2 | import Lax17.PathOfSets |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: A grid minor from a strong path-of-sets system |
| 7 | type: theorem |
| 8 | --- |
| 9 | A sufficiently long and wide strong path-of-sets system contains a |
| 10 | prescribed square grid minor. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax17.StrongPathOfSetsContainsGrid |
| 14 | |
| 15 | universe u |
| 16 | |
| 17 | /-- A strong path-of-sets system of length at least `2g(g-1)` and width at |
| 18 | least `16g² + 10g` contains the `g × g` grid as a minor. -/ |
| 19 | axiom strongPathOfSetsContainsGrid : |
| 20 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 21 | (G : SimpleGraph V) {ℓ w g : ℕ}, |
| 22 | Nonempty (Lax17.PathOfSets.StrongSystem G ℓ w) → |
| 23 | 2 ≤ g → |
| 24 | 2 * g * (g - 1) ≤ ℓ → |
| 25 | 16 * g ^ 2 + 10 * g ≤ w → |
| 26 | Lax17.GridMinor.ContainsGridMinor G g |
| 27 | |
| 28 | end Lax17.StrongPathOfSetsContainsGrid |
| 29 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments