Mathlib Map

Theorems · Theorem · combinatorics

Graph.IsSubgraph.compatible

∀ {α : Type u_1} {β : Type u_2} {G H : Graph α β}, H ≤ G → H.Compatible G

Alias of Graph.Compatible.of_le.

Defined in
Mathlib.Combinatorics.Graph.Subgraph
Cited by
3 results in Mathlib
Foundations
Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Graph.vertexSet_ssubset_or_edgeSet_ssubset_of_lt · cited by 0Graph.vertexSet_ssubset_o…Graph.IsSpanningSubgraph.ext_of_edgeSet · cited by 0IsSpanningSubgraph.ext_of…Graph.IsInducedSubgraph.ext_of_vertexSet · cited by 0IsInducedSubgraph.ext_of_…Graph · cited by 242GraphGraph.Compatible · cited by 21Graph.CompatibleGraph.Compatible.of_le · cited by 3Compatible.of_leIsSubgraph.compatibleCITED BYCITES

Cites3

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.