Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.edgeFinset

{V : Type u_1} → (G : SimpleGraph V) → [Fintype ↑G.edgeSet] → Finset (Sym2 V)

The edgeSet of the graph as a Finset.

Defined in
Mathlib.Combinatorics.SimpleGraph.Finite
Cited by
116 results in Mathlib
Foundations
Depth 60 from the axioms, rests on 757 definitions · uses propext, Classical.choice, Quot.sound
Assumes
Fintype

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by120

Results whose statement or proof uses this declaration.