bibd_block_clique_graph
The modified block-clique graph K_v^*(D) of a balanced incomplete block design D with parameters (v, b, r, k, λ) is the simple graph on vertex set X ⊕ (B × Fin k) whose edges connect each local vertex (b, j) to the point vertex D.block_pts b j, and connect distinct local vertices (b, j₁) and (b, j₂) belonging to the same block b.
Statement
def bibd_block_clique_graph {X B : Type*} {v b r k lam : ℕ} (D : BIBD X B v b r k lam) : SimpleGraph (X ⊕ (B × Fin k))
- Defined in
- arXiv:2611.05762 Sec. 6.9
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Built on 1
- BIBDA structure BIBD parameterized by types X and B and natural numbers v, b, r, k, lam, with fields: card_points asserting Nat.card X = v;…
- Used by 2
- bibd_isomorphic_of_block_clique_graph_isoOP-1148: if two BIBDs D₁, D₂ with the same parameters (v, b, r, k, λ) on finite block sets have isomorphic modified block-clique graphs…
- bibd_isomorphic_of_block_clique_graph_iso_of_three_leRecoverability of a BIBD from its modified block-clique graph when the block size k is at least 3: if two BIBDs D₁, D₂ with the same…
Read back from the Lean
Given types X and B, natural numbers v, b, r, k, lam, and a balanced incomplete block design D : BIBD X B v b r k lam, bibd_block_clique_graph D is the SimpleGraph on the disjoint union vertex set X ⊕ (B × Fin k) defined by:
- Two vertices in X (Sum.inl x and Sum.inl y) are never adjacent.
- A vertex in X (Sum.inl x) and a vertex in B × Fin k (Sum.inr (b, j)) are adjacent if and only if D.block_pts b j = x (i.e., x is the j-th point of block b).
- Two vertices in B × Fin k (Sum.inr (b1, j1) and Sum.inr (b2, j2)) are adjacent if and only if b1 = b2 and j1 ≠ j2 (i.e., for each block b, the vertices {(b, j) | j : Fin k} form a clique of size k, with no edges between distinct blocks).
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 modified block-clique graph K_v^*(r, k, λ) of a BIBD D on vertex set X ⊕ (B × Fin k). -/ def bibd_block_clique_graph {X B : Type*} {v b r k lam : ℕ} (D : BIBD X B v b r k lam) : SimpleGraph (X ⊕ (B × Fin k)) := { Adj := fun u v => match u, v with | Sum.inl x, Sum.inr (b_idx, j) => D.block_pts b_idx j = x | Sum.inr (b_idx, j), Sum.inl x => D.block_pts b_idx j = x | Sum.inr (b1, j1), Sum.inr (b2, j2) => b1 = b2 ∧ j1 ≠ j2 | Sum.inl _, Sum.inl _ => False symm := ⟨by intro u v h rcases u with x | ⟨b1, j1⟩ <;> rcases v with y | ⟨b2, j2⟩ <;> simp_all [ne_comm]⟩ loopless := ⟨by intro u h rcases u with x | ⟨b, j⟩ <;> simp_all⟩ }