is_induced_claw
def
For a simple graph G on type V and a finite subset of vertices s : Finset V, is_induced_claw G s asserts that the induced subgraph of G on s is isomorphic to the complete bipartite graph completeBipartiteGraph (Fin 1) (Fin 3).
Statement
def is_induced_claw {V : Type*} (G : SimpleGraph V) (s : Finset V) : Prop
- Defined in
- arXiv:2511.19585
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 1
- is_claw_packingFor a simple graph G on type V and a finite set of finite vertex subsets P : Finset (Finset V), is_claw_packing G P asserts that every s…
Read back from the Lean
Given a type V, a simple graph G on V, and a finite subset s : Finset V, is_induced_claw G s asserts that the induced subgraph of G on the set s is isomorphic (as a simple graph) to the complete bipartite graph completeBipartiteGraph (Fin 1) (Fin 3) (i.e., the claw graph $K_{1, 3}$).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A subset of four vertices inducing the complete bipartite graph K_{1,3} (a claw). -/ def is_induced_claw {V : Type*} (G : SimpleGraph V) (s : Finset V) : Prop := Nonempty (G.induce (s : Set V) ≃g completeBipartiteGraph (Fin 1) (Fin 3))