Mathlib Map

Theorems · Definition · combinatorics

Rel.interedges

{α : Type u_4} →
  {β : Type u_5} → (r : α → β → Prop) → [(a : α) → DecidablePred (r a)] → Finset α → Finset β → Finset (α × β)

Finset of edges of a relation between two finsets of vertices.

Defined in
Mathlib.Combinatorics.SimpleGraph.Density
Cited by
27 results in Mathlib
Foundations
Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidablePred

Around this declaration

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

Cites3

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

Cited by29

Results whose statement or proof uses this declaration.