ring_diamond_graph
def
The ring of 20 diamonds: the simple graph on the vertices (i,c) with i < 20 and c < 3 whose edge set is ring_diamond_edge_finset, i.e. 20 blocks, each joining the ring vertices (i,0) and (i+1,0) (indices mod 20) by two internally disjoint paths of length 2.
Statement
open Sym2 in def ring_diamond_graph : SimpleGraph (Fin 20 × Fin 3)
- Source
- step towards near_minimum_cycle_counting_bound_real_exponent
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- ring_diamond_edge_finsetThe edge set of the ring of 20 diamonds on the 60 vertices (i,c) with i < 20 and c < 3: for each i, the ring vertex (i,0) is joined to the…
- Used by 1
- ring_diamond_graph_edge_fintypeThe edge set of the 60-vertex ring of 20 diamonds is finite, so
ring_diamond_graph.edgeFinsetis available.
- ring_diamond_graph_edge_fintypeThe edge set of the 60-vertex ring of 20 diamonds is finite, so
Lean source view module on GitHub
open Sym2 in /-- The ring of 20 diamonds: the simple graph on the 60 vertices (i,c) whose edges are the 80 edges of `ring_diamond_edge_finset`. -/ def ring_diamond_graph : SimpleGraph (Fin 20 × Fin 3) := SimpleGraph.fromEdgeSet (↑ring_diamond_edge_finset : Set (Sym2 (Fin 20 × Fin 3)))