Departure times on a proper graph
Lax330177.ProperPathTimes · concepts/Lax330177/ProperPathTimes.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
On a proper directed or undirected graph, every nonstrict temporal path already has strictly increasing departure times.
Concept map
In the paper
- page 2 of this submission's paper
Lean source view on GitHub
| 1 | import Lax330177.Paths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Departure times on a proper graph |
| 6 | type: lemma |
| 7 | --- |
| 8 | On a proper directed or undirected graph, every nonstrict temporal path already has strictly increasing departure times. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.proper_path_times.html) |
| 11 | -/ |
| 12 | namespace Lax330177.ProperPathTimes |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | |
| 17 | axiom proper_path_times {n k} (G : Graph n) (d : Direction) (hg : IsProper d G) (w : TemporalPath G .nonstrict k) : StrictMono w.val.time |
| 18 | end Lax330177.ProperPathTimes |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments