dominating_average_stability_path_five_decidable
def
An explicit computable adjacency decision for the five-vertex path.
Statement
def dominating_average_stability_path_five_decidable :
DecidableRel (SimpleGraph.pathGraph 5).Adj- Source
- Finite sharpness certificate for the original OP-544 / IN-263 stability question. arXiv:2208.10475v2 Theorem2.9 supplies the extremal background. This formalizes the already computationally observed P5 obstruction to a smaller coefficient, not a proof of the universal bound or a research advance.
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Used by 6
- dominating_average_stability_constant_lower_boundAny multiplicative stability coefficient valid on the five-vertex path is at least51/5. This is a necessary constant, not the universal…
- dominating_average_stability_path_five_deletionThe minimum star-like vertex deletion distance of the five-vertex path is exactly1.
- dominating_average_stability_path_five_delete_endpointDeleting an endpoint from the five-vertex path leaves a star-like induced graph.
- dominating_average_stability_path_five_not_starThe five-vertex path is not star-like.
- dominating_average_stability_path_five_no_isolatedThe five-vertex path has no isolated vertex.
- dominating_average_stability_path_five_meanThe five-vertex path has average dominating-set size55/17.
Lean source view module on GitHub
def dominating_average_stability_path_five_decidable : DecidableRel (SimpleGraph.pathGraph 5).Adj := fun u v => decidable_of_iff (u.val+1=v.val ∨ v.val+1=u.val) SimpleGraph.pathGraph_adj.symm