Theorems · Definition · combinatorics
SimpleGraph.Dart.edge
{V : Type u_1} → {G : SimpleGraph V} → G.Dart → Sym2 VThe edge associated to the dart.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Dart
- Cited by
- 32 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- Sym2statement · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.Dartstatement and proof · cited by 109
- SimpleGraph.Dart.toProdproof · cited by 48
Cited by33
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.edgesproof · cited by 145
- SimpleGraph.Walk.fst_mem_support_of_mem_edgesproof · cited by 9
- SimpleGraph.Walk.edges_reverseproof · cited by 6
- SimpleGraph.Walk.length_edgesproof · cited by 3
- SimpleGraph.IsTree.card_edgeFinsetproof · cited by 3
- SimpleGraph.Walk.rotate_edgesproof · cited by 3
- SimpleGraph.Walk.edges_appendproof · cited by 3
- SimpleGraph.dart_card_eq_twice_card_edgesproof · cited by 2
- SimpleGraph.dart_edge_eq_iffstatement · cited by 2
- SimpleGraph.dart_edge_eq_mk'_iffstatement · cited by 2
- SimpleGraph.Walk.getElem_edges_eq_edge_getElem_dartsstatement and proof · cited by 2
- SimpleGraph.Walk.edges_bypass_sublist_edgesproof · cited by 2