AFTD Auto-Formalizing Theoretical Domains

IsClawFree

def

A simple graph G is claw-free if it does not contain the complete bipartite graph K_{1,3} as an induced subgraph.

Statement

def IsClawFree {V : Type*} (G : SimpleGraph V) : Prop
Defined in
arXiv:2610.20129 Sec. 1.1
Verified
25 Oct 2026
Axioms
none listed
Used by 11

Read back from the Lean

For a type V and a simple graph G on V, IsClawFree G is defined to hold if and only if the complete bipartite graph $K_{1, 3}$ with parts of size 1 and 3 (specifically, with vertex type Fin 1 ⊕ Fin 3) is not an induced subgraph of G (i.e., ¬ SimpleGraph.IsIndContained (completeBipartiteGraph (Fin 1) (Fin 3)) G).

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 simple graph is claw-free if it does not contain K_{1,3} as an induced subgraph. -/
def IsClawFree {V : Type*} (G : SimpleGraph V) : Prop := ¬ SimpleGraph.IsIndContained (completeBipartiteGraph (Fin 1) (Fin 3)) G
See it in the graphDiscuss this resultChallenge it