Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsTree.existsUnique_path

∀ {V : Type u_1} {G : SimpleGraph V}, G.IsTree → ∀ (v w : V), ∃! p, p.IsPath
Defined in
Mathlib.Combinatorics.SimpleGraph.Acyclic
Cited by
1 results in Mathlib
Foundations
Depth 87 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.

SimpleGraph.IsTree.card_edgeFinset · cited by 3IsTree.card_edgeFinsetSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Walk · cited by 915SimpleGraph.WalkExistsUnique · cited by 268ExistsUniqueSimpleGraph.Walk.IsPath · cited by 140Walk.IsPathSimpleGraph.IsTree · cited by 32SimpleGraph.IsTreeSimpleGraph.isTree_iff_existsUnique_path · cited by 1SimpleGraph.isTree_iff_ex…IsTree.existsUnique_pathCITED BYCITES

Cites6

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

Cited by1

Results whose statement or proof uses this declaration.