Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.edgeDensity_def

∀ {α : Type u_4} (G : SimpleGraph α) [inst : DecidableRel G.Adj] (s t : Finset α),
  G.edgeDensity s t = ↑(G.interedges s t).card / (↑s.card * ↑t.card)
Defined in
Mathlib.Combinatorics.SimpleGraph.Density
Cited by
1 results in Mathlib
Foundations
Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableRel
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.edgeDensity_add_edgeDensity_compl · cited by 0SimpleGraph.edgeDensity_a…Finset · cited by 13712FinsetSimpleGraph · cited by 3072SimpleGraphFinset.card · cited by 2327Finset.cardSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.edgeDensity · cited by 31SimpleGraph.edgeDensitySimpleGraph.interedges · cited by 23SimpleGraph.interedgesSimpleGraph.edgeDensity_defCITED 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.