g5_adj
abbrev
G_5 on vertices r_1, r_2, w_1, w_2, r_3 (indices 0..4): edges r_1 r_2, w_1 w_2, r_2 w_2, and r_3 adjacent to all.
Statement
abbrev g5_adj (i j : Fin 5) : Prop
- Defined in
- arXiv:2610.21388 (Stronger spectral bound for clique number), Definition 2.1 with t = 5 and the vertex order fixed after it
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 6
- b5_graph_adjSanity lemma: adjacency in B_5 unfolds to: distinct, and the same block or adjacent blocks of G_5.
- g5_adj_symmSanity lemma: the adjacency of G_5 is symmetric.
- b5_quotient_matrixM_ii = n_i - 1, M_ij = a_ij n_j (a = adjacency of G_5); the eigenvalues of M are those of B_5 other than -1 (Theorem 2.3 of…
- b5_graphThe graph B_5(n_1..n_5) of arXiv:2610.21388: each vertex i of G_5 is replaced by a clique of n_i vertices, and cliques of adjacent…
- b5_quotient_trace_sqtr(M^2) = Σ (n_i - 1)^2 + 2 (n_0 n_1 + n_2 n_3 + n_1 n_3 + n_4 (n_0 + n_1 + n_2 + n_3)) for the quotient matrix of B_5.
- b5_cliqueNumω(B_5(n_0..n_4)) = n_4 + max(n_0 + n_1, n_1 + n_3, n_2 + n_3).
Lean source view module on GitHub
/-- Adjacency of the base graph `G₅` of arXiv:2610.21388, Def. 2.1 (`t = 5`), on `Fin 5` in the paper's order `r₁, r₂, w₁, w₂, r₃`: the path `r₁ - r₂ - w₂ - w₁` plus `r₃` joined to all other vertices. -/ abbrev g5_adj (i j : Fin 5) : Prop := i ≠ j ∧ (i = 4 ∨ j = 4 ∨ (i, j) ∈ ({(0, 1), (1, 0), (1, 3), (3, 1), (2, 3), (3, 2)} : Finset (Fin 5 × Fin 5)))