Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsAcyclic.embedding

∀ {V : Type u_1} {V' : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph V'} (f : G ↪g G'), G'.IsAcyclic → G.IsAcyclic
Defined in
Mathlib.Combinatorics.SimpleGraph.Acyclic
Cited by
3 results in Mathlib
Foundations
Depth 27 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.Iso.isAcyclic_iff · cited by 1Iso.isAcyclic_iffSimpleGraph.IsAcyclic.of_comap · cited by 1IsAcyclic.of_comapSimpleGraph.IsAcyclic.of_map · cited by 0IsAcyclic.of_mapSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsAcyclic · cited by 67SimpleGraph.IsAcyclicSimpleGraph.Embedding · cited by 41SimpleGraph.EmbeddingRelEmbedding.injective · cited by 41RelEmbedding.injectiveRelEmbedding.toRelHom · cited by 15RelEmbedding.toRelHomSimpleGraph.IsAcyclic.comap · cited by 4IsAcyclic.comapIsAcyclic.embeddingCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.