Enlarging the allowed vertex set
Lax330177.RestrictedMonotonicity · concepts/Lax330177/RestrictedMonotonicity.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
A path restricted to C remains feasible in any vertex superset D.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Enlarging the allowed vertex set |
| 6 | type: lemma |
| 7 | --- |
| 8 | A path restricted to C remains feasible in any vertex superset D. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Observations.allowed_mono.html) |
| 11 | -/ |
| 12 | namespace Lax330177.RestrictedMonotonicity |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings Lax330177.Paths |
| 15 | variable {n k : ℕ} {G : Graph n} {mode : TraversalMode} |
| 16 | |
| 17 | axiom allowed_mono {C D : Finset (Fin n)} (h : C ⊆ D) {u v} : ReachesIn G mode C u v → ReachesIn G mode D u v |
| 18 | end Lax330177.RestrictedMonotonicity |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments