Theorems · Theorem · combinatorics
SimpleGraph.EdgeDisjointTriangles.map
∀ {α : Type u_1} {β : Type u_2} {G : SimpleGraph α} (f : α ↪ β),
G.EdgeDisjointTriangles → (SimpleGraph.map (⇑f) G).EdgeDisjointTriangles- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setproof · cited by 53,352
- Finsetproof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Set.imageproof · cited by 5,609
- SimpleGraphstatement and proof · cited by 3,072
- Function.Embeddingstatement and proof · cited by 988
- Finset.mapproof · cited by 747
- Set.Pairwiseproof · cited by 321
- Function.Injective.injOnproof · cited by 280
- Set.Subsingletonproof · cited by 276
- Finset.coe_mapproof · cited by 114
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.LocallyLinear.mapproof · cited by 2