Theorems · Definition · combinatorics
SimpleGraph.Subgraph.edgeSet
{V : Type u} → {G : SimpleGraph V} → G.Subgraph → Set (Sym2 V)The edge set of G' consists of a subset of edges of G.
- Cited by
- 37 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Sym2statement · cited by 737
- SimpleGraph.Subgraphstatement and proof · cited by 326
- Sym2.fromRelproof · cited by 33
- SimpleGraph.Subgraph.symmproof · cited by 3
Cited by39
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.IsMatching.toEdgestatement · cited by 6
- SimpleGraph.Subgraph.edgeSet_monostatement · cited by 3
- SimpleGraph.Subgraph.edgeSet_subsetstatement · cited by 3
- SimpleGraph.Subgraph.IsMatching.toEdge_eq_of_adjstatement and proof · cited by 3
- SimpleGraph.Walk.mem_edges_toSubgraphstatement and proof · cited by 3
- SimpleGraph.Subgraph.edgeSet_coestatement · cited by 2
- SimpleGraph.Subgraph.incidenceSetproof · cited by 2
- SimpleGraph.killCopies_defstatement · cited by 2
- SimpleGraph.Subgraph.mem_edgeSetstatement · cited by 2
- SimpleGraph.Subgraph.mem_verts_of_mem_edgestatement and proof · cited by 2
- SimpleGraph.Subgraph.edgeSet_botstatement · cited by 1
- SimpleGraph.Subgraph.edgeSet_infstatement and proof · cited by 1