simple_graph_of_edge_list
def
The simple graph on {0,…,n−1} whose edges are the unordered pairs occurring in the list L (a pair (a, b) in L contributes the edge {a, b}, and a pair (a, a) contributes nothing).
Statement
def simple_graph_of_edge_list {n : ℕ} (L : List (Fin n × Fin n)) : SimpleGraph (Fin n)- Source
- step towards exists_nonempty_regular_eight_triangle_distinct
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 3
- simple_graph_of_edge_list_decidable_relAdjacency in the graph determined by an edge list is decidable.
- eight_regular_triangle_distinct_certificateA computable boolean certificate checker for the regularity-8 witness problem: it returns true exactly when every one of the n vertices…
- eight_regular_triangle_distinct_of_certificateIf the computable certificate checker accepts the edge list L on the n vertices {0,…,n−1}, then the graph of L is 8-regular and has…
Lean source view module on GitHub
/-- Graph on `Fin n` built from a list of ordered vertex pairs, symmetrized and made irreflexive by `SimpleGraph.fromRel`. -/ def simple_graph_of_edge_list {n : ℕ} (L : List (Fin n × Fin n)) : SimpleGraph (Fin n) := SimpleGraph.fromRel fun a b => (a, b) ∈ L