inst_decidableRel_pathGraph
instance
Adjacency in the path graph pathGraph n is decidable.
Statement
instance inst_decidableRel_pathGraph (n : ℕ) : DecidableRel (SimpleGraph.pathGraph n).Adj- Source
- step towards claw_free_tree_graph_state_mmi
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 7
- petrial_R_is_treeFor every natural number m, the graph R_m is a tree.
- dephased_path_interval_indicator_mem_supported_kernelAn alternating interval contained in a path subsystem has its indicator in the supported cut kernel exactly when all its selected weights…
- tree_exposure_plain_partial_sync_counterexampleFor a rooted three-vertex path the unexposed counts at ranks zero and one are one and three, while the exposed counts at ranks zero, one…
- moving_target_grid_accuracy_le_minFor all M, N ≥ 1, on the M × N rectangular grid (vertices Fin M × Fin N, adjacent when they differ by one in exactly one coordinate) there…
- instDecidableRelPetrialRGraphAdjFor every natural number m, adjacency between vertices in the graph R_m is decidable.
- op_1239_path_graph_petrial_log_concaveFor every n : ℕ, the path graph pathGraph n has a log-concave partial Petrial polynomial (petrial_log_concave (SimpleGraph.pathGraph n)).
- dephased_path_markedFor n : ℕ and S : Finset (Fin n), dephased_path_marked n S is the Finset (Fin n) of vertices u ∈ S for which there exists a vertex v : Fin…
Lean source view module on GitHub
/-- Decidable adjacency for `SimpleGraph.pathGraph n`, from `pathGraph_adj`. -/ instance inst_decidableRel_pathGraph (n : ℕ) : DecidableRel (SimpleGraph.pathGraph n).Adj := fun _ _ => decidable_of_iff _ SimpleGraph.pathGraph_adj.symm