Theorems · Definition · combinatorics
SimpleGraph.toSubgraph
{V : Type u} → {G : SimpleGraph V} → (H : SimpleGraph V) → H ≤ G → G.SubgraphTurn a subgraph of a SimpleGraph into a member of its subgraph type.
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
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.
- Set.univproof · cited by 3,945
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- Set.mem_univproof · cited by 416
- SimpleGraph.Subgraphstatement · cited by 326
- SimpleGraph.symmproof · cited by 8
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.Preconnected.toSubgraphstatement and proof · cited by 1
- SimpleGraph.Reachable.coe_toSubgraphstatement and proof · cited by 1
- SimpleGraph.toSubgraph_vertsstatement and proof · cited by 1
- SimpleGraph.toSubgraph_adjstatement and proof · cited by 1
- SimpleGraph.card_neighborSet_toSubgraphstatement and proof · cited by 1
- SimpleGraph.toSubgraph.congr_simpstatement and proof · cited by 0
- SimpleGraph.toSubgraph.isSpanningstatement · cited by 0
- SimpleGraph.Subgraph.IsPerfectMatching.toSubgraph_iffstatement · cited by 0
- SimpleGraph.degree_toSubgraphstatement and proof · cited by 0
- SimpleGraph.Connected.toSubgraphstatement · cited by 0