Nowhere dense classes are uniformly quasi-wide
Lax199508.NowhereDenseUQW · concepts/Lax199508/NowhereDenseUQW.lean · lax-199508
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Every nowhere dense graph class is uniformly quasi-wide: for every radius r there are a threshold function N and a separator bound s such that in every member, every vertex set of size at least N(m) contains a distance-r independent subset of size at least m after deleting at most s vertices.
This is Lemma 3.4 of Chapter 4 of the source lecture notes (2019/20 edition), the hard direction of their Theorem 3.2, which states that a graph class is uniformly quasi-wide if and only if it is nowhere dense.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax199508.NowhereDenseClasses |
| 2 | import Lax199508.UniformQuasiWideness |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Nowhere dense classes are uniformly quasi-wide |
| 7 | type: theorem |
| 8 | --- |
| 9 | Every nowhere dense graph class is uniformly quasi-wide: for every |
| 10 | radius *r* there are a threshold function *N* and a separator bound *s* |
| 11 | such that in every member, every vertex set of size at least *N*(*m*) |
| 12 | contains a distance-*r* independent subset of size at least *m* after |
| 13 | deleting at most *s* vertices. |
| 14 | |
| 15 | This is Lemma 3.4 of Chapter 4 of the source lecture notes (2019/20 |
| 16 | edition), the hard direction of their Theorem 3.2, which states that a |
| 17 | graph class is uniformly quasi-wide if and only if it is nowhere dense. |
| 18 | |
| 19 | # Formalization notes |
| 20 | |
| 21 | Hypothesis and conclusion are the shared predicates of the two imported |
| 22 | definition concepts, so the statement adds nothing of its own. The |
| 23 | strength of the theorem is entirely in the quantifier order already |
| 24 | carried by `UniformlyQuasiWide`: the separator bound depends on the |
| 25 | class and the radius alone, not on the requested size or on the member. |
| 26 | The converse implication holds on subgraph-closed classes but is a |
| 27 | separate claim with a separate proof and is not stated here. |
| 28 | -/ |
| 29 | |
| 30 | namespace Lax199508.NowhereDenseUQW |
| 31 | |
| 32 | open Lax199508.GraphClasses Lax199508.NowhereDenseClasses Lax199508.UniformQuasiWideness |
| 33 | |
| 34 | /-- Nowhere dense graph classes are uniformly quasi-wide. -/ |
| 35 | axiom uniformlyQuasiWide_of_nowhereDense |
| 36 | (C : GraphClass) (h : NowhereDense C) : |
| 37 | UniformlyQuasiWide C |
| 38 | |
| 39 | end Lax199508.NowhereDenseUQW |
| 40 |
Formalization notes
Hypothesis and conclusion are the shared predicates of the two imported definition concepts, so the statement adds nothing of its own. The strength of the theorem is entirely in the quantifier order already carried by : the separator bound depends on the class and the radius alone, not on the requested size or on the member. The converse implication holds on subgraph-closed classes but is a separate claim with a separate proof and is not stated here.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments