Theorems · Theorem · combinatorics
SimpleGraph.IsMatchingFree.mono
∀ {V : Type u_1} {G G' : SimpleGraph V}, G ≤ G' → G'.IsMatchingFree → G.IsMatchingFree- Cited by
- 0 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, 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
- Set.image_congrproof · cited by 533
- SimpleGraph.Subgraphproof · cited by 326
- SimpleGraph.Subgraph.vertsproof · cited by 210
- Set.image_id'proof · cited by 86
- SimpleGraph.Hom.ofLEproof · cited by 27
- SimpleGraph.Subgraph.mapproof · cited by 24
- SimpleGraph.Subgraph.IsPerfectMatchingproof · cited by 18
- SimpleGraph.Subgraph.map_vertsproof · cited by 13
- SimpleGraph.IsMatchingFreestatement and proof · cited by 3
- SimpleGraph.Subgraph.IsMatching.map_ofLEproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.