h_subdivided_k33
def
The 7-vertex graph obtained by subdividing one edge of the complete bipartite graph K_{3,3} exactly once.
Statement
def h_subdivided_k33 : SimpleGraph (Fin 7)- Defined in
- arXiv:2610.32404, Section 11
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 3
- subdivided_k33_line_graph_isk4_diamond_free_four_chromaticLet H be the graph obtained from K3,3 by subdividing one edge exactly once, and let G be its line graph. Then G has no induced subdivision…
- subdivided_k33_line_graph_chromatic_number_eq_fourThe line graph of the graph obtained by subdividing one edge of K3,3 once has chromatic number exactly four.
- 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
h_subdivided_k33 is defined as the simple graph on the vertex set Fin 7 whose edges are given by SimpleGraph.fromRel applied to the symmetric binary relation containing exactly the ten undirected pairs: {0, 6}, {3, 6}, {0, 4}, {0, 5}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, and {2, 5}.
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 7-vertex graph H obtained from K_{3,3} by subdividing one edge once. -/ def h_subdivided_k33 : SimpleGraph (Fin 7) := SimpleGraph.fromRel (fun u v => (u = 0 ∧ v = 6) ∨ (u = 6 ∧ v = 0) ∨ (u = 6 ∧ v = 3) ∨ (u = 3 ∧ v = 6) ∨ (u = 0 ∧ v = 4) ∨ (u = 4 ∧ v = 0) ∨ (u = 0 ∧ v = 5) ∨ (u = 5 ∧ v = 0) ∨ (u = 1 ∧ v = 3) ∨ (u = 3 ∧ v = 1) ∨ (u = 1 ∧ v = 4) ∨ (u = 4 ∧ v = 1) ∨ (u = 1 ∧ v = 5) ∨ (u = 5 ∧ v = 1) ∨ (u = 2 ∧ v = 3) ∨ (u = 3 ∧ v = 2) ∨ (u = 2 ∧ v = 4) ∨ (u = 4 ∧ v = 2) ∨ (u = 2 ∧ v = 5) ∨ (u = 5 ∧ v = 2))