temporal_walk_explores_by
def
A walk explores the temporal graph by time T if every vertex is visited at some time t ≤ T.
Statement
def temporal_walk_explores_by {n : ℕ} (w : ℕ → Fin n) (T : ℕ) : Prop
- Defined in
- arXiv:2610.06228 (Hiding a Vertex from the Temporal Explorer), Sec. 2 (exploration)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Used by 3
- temporal_connected_explore_sqEvery temporal graph on n vertices all of whose snapshots are connected can be explored from any start vertex within (n − 1)² time steps.
- temporal_path_four_requires_sixThere is a temporal graph on four vertices with spanning-path snapshots such that every temporal walk starting at vertex 0 needs at least…
- temporal_path_five_requires_nineThere is a temporal graph on five vertices with spanning-path snapshots such that every walk from vertex 0 needs at least nine steps to…
Lean source view module on GitHub
/-- The walk `w` has visited every vertex by time `T`. -/ def temporal_walk_explores_by {n : ℕ} (w : ℕ → Fin n) (T : ℕ) : Prop := ∀ u, ∃ t ≤ T, w t = u