proven
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Theorem
A graph with no small balanced separator contains every square grid whose vertices-plus-edges complexity fits the explicit Theorem 8.1 budget.
Lean source view on GitHub
| 1 | import Mathlib.Data.Nat.Log |
| 2 | import Lax17.Degree |
| 3 | import Lax17.Expansion |
| 4 | import Lax17.GridMinor |
| 5 | |
| 6 | /-! |
| 7 | --- |
| 8 | title: Grid minors from separator expansion |
| 9 | type: theorem |
| 10 | --- |
| 11 | A graph with no small balanced separator contains every square grid whose |
| 12 | vertices-plus-edges complexity fits the explicit Theorem 8.1 budget. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax17.ExpanderGrid |
| 16 | |
| 17 | universe u |
| 18 | |
| 19 | /-- The expander-to-grid handoff in the no-small-balanced-separator form. -/ |
| 20 | axiom expanderContainsGrid : |
| 21 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 22 | (G : SimpleGraph V) (d g : ℕ), |
| 23 | 2 ≤ Fintype.card V → |
| 24 | Lax17.Expansion.NoSmallBalancedSeparator G d → |
| 25 | ((3 * (d + 1) * (15 * (d + 1))) * 8) * |
| 26 | (5 * g ^ 2) * Nat.log 2 (Fintype.card V) ≤ |
| 27 | Fintype.card V → |
| 28 | Lax17.GridMinor.ContainsGridMinor G g |
| 29 | |
| 30 | end Lax17.ExpanderGrid |
| 31 |
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