A proper graph can have a walk with equal departure times
Lax330177.BounceSameTime · concepts/Lax330177/BounceSameTime.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
On a proper undirected graph, a nonstrict walk can traverse one edge and immediately traverse it back at the same time.
Concept map
In the paper
- page 2 of this submission's paper
Lean source view on GitHub
| 1 | import Lax330177.Examples |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: A proper graph can have a walk with equal departure times |
| 6 | type: lemma |
| 7 | --- |
| 8 | On a proper undirected graph, a nonstrict walk can traverse one edge and immediately traverse it back at the same time. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.Basic.bounce_same_time.html) |
| 11 | -/ |
| 12 | namespace Lax330177.BounceSameTime |
| 13 | open Lax330177.Representations |
| 14 | open Lax330177.Settings |
| 15 | open Lax330177.Paths |
| 16 | open Lax330177.Examples |
| 17 | |
| 18 | axiom bounce_same_time : IsProper .undirected repeatedEdge ∧ ¬ StrictMono simultaneousBounce.time |
| 19 | end Lax330177.BounceSameTime |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments