book_graph
def
The book graph B_n is the graph consisting of n triangles sharing a common edge (spine), formalized on vertices Fin 2 ⊕ Fin n.
Statement
def book_graph (n : ℕ) : SimpleGraph (Fin 2 ⊕ Fin n)- Defined in
- arXiv:2610.36522
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 1
- not_not_isContained_book_graph_of_commonNeighbors_leThe statement
not_isContained_book_graph_of_commonNeighbors_leis false: The statement is FALSE for k = 0. Under Lean'sNat…
- not_not_isContained_book_graph_of_commonNeighbors_leThe statement
Read back from the Lean
For a natural number n, book_graph n is the simple graph with vertex type Fin 2 ⊕ Fin n (the disjoint union of a 2-element type and an n-element type) where:
- two vertices in Fin 2 (in the left summand) are adjacent if and only if they are distinct;
- every vertex in Fin 2 (left summand) is adjacent to every vertex in Fin n (right summand);
- every vertex in Fin n (right summand) is adjacent to every vertex in Fin 2 (left summand);
- no two vertices in Fin n (right summand) are adjacent.
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 book graph B_n is the join K_2 + K_n^c on Fin 2 ⊕ Fin n. -/ def book_graph (n : ℕ) : SimpleGraph (Fin 2 ⊕ Fin n) where Adj | .inl i, .inl j => i ≠ j | .inl _, .inr _ => True | .inr _, .inl _ => True | .inr _, .inr _ => False symm := ⟨by rintro (x | x) (y | y) h <;> simp_all [Ne.symm]⟩ loopless := ⟨by rintro (x | x) h <;> simp_all⟩