Theorems · Definition · combinatorics
SimpleGraph.interedges
{α : Type u_4} → (G : SimpleGraph α) → [DecidableRel G.Adj] → Finset α → Finset α → Finset (α × α)Finset of edges of a relation between two finsets of vertices.
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Rel.interedgesproof · cited by 27
Cited by23
Results whose statement or proof uses this declaration.
- SimpleGraph.interedges_defstatement · cited by 1
- SimpleGraph.edgeDensity_defstatement · cited by 1
- SimpleGraph.triangle_counting'proof · cited by 1
- SimpleGraph.card_interedges_add_card_interedges_complstatement and proof · cited by 1
- SimpleGraph.regularityReduced_edges_card_auxproof · cited by 1
- SimpleGraph.unreduced_edges_subsetstatement · cited by 1
- Finpartition.IsEquipartition.card_interedges_sparsePairs_lestatement · cited by 1
- Finpartition.IsEquipartition.card_interedges_sparsePairs_le'statement and proof · cited by 1
- SimpleGraph.swap_mem_interedges_iffstatement · cited by 0
- SimpleGraph.interedges_biUnionstatement · cited by 0
- SimpleGraph.interedges_biUnion_leftstatement · cited by 0
- SimpleGraph.interedges_biUnion_rightstatement · cited by 0