Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.reachable_or_compl_adj

∀ {V : Type u} (G : SimpleGraph V) (u v : V), G.Reachable u v ∨ Gᶜ.Adj u v
Defined in
Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Cited by
1 results in Mathlib
Foundations
Depth 13 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.reachable_or_reachable_compl · cited by 1SimpleGraph.reachable_or_…SimpleGraph · cited by 3072SimpleGraphCompl.compl · cited by 2925Compl.complSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Reachable · cited by 141SimpleGraph.ReachableSimpleGraph.Adj.reachable · cited by 17Adj.reachableSimpleGraph.Reachable.rfl · cited by 4Reachable.rflSimpleGraph.reachable_or_comp…CITED 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.