diamond_graph
def
The diamond graph is the simple graph on vertex type Fin 4 obtained from the complete graph ⊤ by deleting the single edge between vertex 0 and vertex 3.
Statement
def diamond_graph : SimpleGraph (Fin 4)- Defined in
- arXiv:2610.32404:11
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Used by 3
- k4_claw_diamond_free_has_no_induced_k4_subdivisionEvery simple graph containing neither an induced K4, an induced claw, nor an induced diamond contains no induced subdivision of K4.
- is_diamond_freeA simple graph G is diamond-free if it does not contain the diamond graph as an induced subgraph.
- subdivided_k33_line_graph_no_k4_claw_diamondThe line graph of the once-subdivided K3,3 has no induced K4, claw, or diamond.
Read back from the Lean
diamond_graph is defined as the simple graph on the vertex type Fin 4 obtained from the complete graph ⊤ on Fin 4 by deleting the undirected edge between vertex 0 and vertex 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
/-- The diamond graph on vertex type Fin 4, obtained by deleting the edge between 0 and 3 from K_4. -/ def diamond_graph : SimpleGraph (Fin 4) := (⊤ : SimpleGraph (Fin 4)).deleteEdges {s(0, 3)}