Mathlib Map

Theorems · Theorem · combinatorics

Graph.Adj.mono

∀ {α : Type u_1} {β : Type u_2} {x y : α} {G H : Graph α β}, H ≤ G → H.Adj x y → G.Adj x y
Defined in
Mathlib.Combinatorics.Graph.Subgraph
Cited by
4 results in Mathlib
Foundations
Depth 60 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.toSimpleGraph_mono · cited by 0Graph.toSimpleGraph_monoGraph.IsClosedSubgraph.adj_congr · cited by 0IsClosedSubgraph.adj_congrGraph.IsInducedSubgraph.adj_congr · cited by 0IsInducedSubgraph.adj_con…Graph.Loopless.anti · cited by 0Loopless.antiGraph · cited by 242GraphGraph.Adj · cited by 23Graph.AdjGraph.IsLink.mono · cited by 11IsLink.monoGraph.IsLink.adj · cited by 5IsLink.adjAdj.monoCITED BYCITES

Cites4

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

Cited by4

Results whose statement or proof uses this declaration.