Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Subgraph.coe

{V : Type u} → {G : SimpleGraph V} → (G' : G.Subgraph) → SimpleGraph ↑G'.verts

Coercion from G' : Subgraph G to a SimpleGraph G'.verts.

Defined in
Mathlib.Combinatorics.SimpleGraph.Subgraph
Cited by
89 results in Mathlib
Foundations
Depth 10 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Subgraph.hom · cited by 18Subgraph.homSimpleGraph.Subgraph.coe_adj · cited by 12Subgraph.coe_adjSimpleGraph.Subgraph.coeSubgraph · cited by 10Subgraph.coeSubgraphSimpleGraph.copyCount · cited by 8SimpleGraph.copyCountSimpleGraph.IsTutteViolator · cited by 6SimpleGraph.IsTutteViolat…SimpleGraph.Subgraph.hom_apply · cited by 6Subgraph.hom_applySimpleGraph.Subgraph.IsMatching.even_card · cited by 5IsMatching.even_cardSimpleGraph.Subgraph.Preconnected.coe · cited by 5Preconnected.coeSimpleGraph.Subgraph.connected_iff · cited by 5Subgraph.connected_iffSimpleGraph.Subgraph.inclusion · cited by 5Subgraph.inclusionSimpleGraph.Subgraph.preconnected_iff · cited by 5Subgraph.preconnected_iffSimpleGraph.Subgraph.Connected.mono · cited by 4Connected.monoSimpleGraph.Walk.mapToSubgraph · cited by 4Walk.mapToSubgraphSimpleGraph.induce_eq_coe_induce_top · cited by 4SimpleGraph.induce_eq_coe…SimpleGraph.Subgraph.Connected.coe · cited by 4Connected.coeSet.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.verts · cited by 210Subgraph.vertsSimpleGraph.Subgraph.Adj · cited by 147Subgraph.AdjSubgraph.coeCITED BYCITES

Cites5

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

Cited by113

Results whose statement or proof uses this declaration.