Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.Iso.isMatching_map
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {M : G.Subgraph} (f : G ≃g G'),
(SimpleGraph.Subgraph.map f.toHom M).IsMatching ↔ M.IsMatching- Cited by
- 0 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Isostatement and proof · cited by 99
- SimpleGraph.Iso.symmproof · cited by 34
- SimpleGraph.Subgraph.IsMatchingstatement and proof · cited by 32
- SimpleGraph.Subgraph.mapstatement and proof · cited by 24
- SimpleGraph.Iso.toHomstatement and proof · cited by 13
- RelIso.injectiveproof · cited by 3
- SimpleGraph.Iso.symm_toHom_comp_toHomproof · cited by 1
- SimpleGraph.Subgraph.map_idproof · cited by 1
- SimpleGraph.Subgraph.IsMatching.mapproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.