Induced grid exclusion in the reduction
Lax762056.GridExclusion · concepts/Lax762056/GridExclusion.lean · lax-762056
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For every finite simple graph , the reduction graph excludes the grid as an induced minor.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
In the paper
- page 5 of this submission's paper
Lean source view on GitHub
| 1 | import Lax762056.Reduction |
| 2 | import Lax762056.Grid |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Induced grid exclusion in the reduction |
| 7 | type: lemma |
| 8 | --- |
| 9 | For every finite simple graph , the reduction graph excludes |
| 10 | the grid as an induced minor. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax762056.GridExclusion |
| 14 | |
| 15 | open Grid Reduction |
| 16 | |
| 17 | axiom reduction_excludes_inducedGrid {n : ℕ} (F : SimpleGraph (Fin n)) : |
| 18 | ExcludesInducedGrid 5 (reductionGraph F) |
| 19 | |
| 20 | end Lax762056.GridExclusion |
| 21 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments