Theorems · Definition · combinatorics
SimpleGraph.EdgeLabeling.get
{V : Type u_1} → {G : SimpleGraph V} → {K : Type u_3} → G.EdgeLabeling K → (x y : V) → G.Adj x y → KConvenience function to get the color of the edge x ~ y in the coloring of the complete graph
on V.
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Sym2.mkproof · cited by 332
- SimpleGraph.EdgeLabelingstatement and proof · cited by 14
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.EdgeLabeling.ext_getstatement and proof · cited by 2
- SimpleGraph.EdgeLabeling.get_pullbackstatement · cited by 0
- SimpleGraph.TopEdgeLabeling.labelGraph_adjstatement · cited by 0
- SimpleGraph.EdgeLabeling.get.congr_simpstatement and proof · cited by 0
- SimpleGraph.toTopEdgeLabeling_getstatement · cited by 0
- SimpleGraph.EdgeLabeling.compRight_getstatement · cited by 0
- SimpleGraph.EdgeLabeling.ext_get_iffstatement and proof · cited by 0
- SimpleGraph.EdgeLabeling.get_commstatement · cited by 0
- SimpleGraph.EdgeLabeling.get_eqstatement · cited by 0
- SimpleGraph.EdgeLabeling.get_mkstatement · cited by 0