Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.IsMatching.eq_of_adj_left

∀ {V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v w : V}, M.IsMatching → M.Adj u v → M.Adj u w → v = w
Defined in
Mathlib.Combinatorics.SimpleGraph.Matching
Cited by
2 results in Mathlib
Foundations
Depth 6 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Subgraph.IsMatching.eq_of_adj_right · cited by 2IsMatching.eq_of_adj_rightSimpleGraph.Subgraph.IsMatching.not_adj_left_of_ne · cited by 0IsMatching.not_adj_left_o…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Subgraph · cited by 326SimpleGraph.SubgraphSimpleGraph.Subgraph.Adj · cited by 147Subgraph.AdjExistsUnique.unique · cited by 42ExistsUnique.uniqueSimpleGraph.Subgraph.IsMatching · cited by 32Subgraph.IsMatchingSimpleGraph.Subgraph.edge_vert · cited by 17Subgraph.edge_vertIsMatching.eq_of_adj_leftCITED BYCITES

Cites6

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

Cited by2

Results whose statement or proof uses this declaration.