Theorems · Definition · combinatorics
SimpleGraph.Iso.refl
{V : Type u_1} → {G : SimpleGraph V} → G ≃g GThe identity isomorphism of a graph with itself.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses 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.Adjproof · cited by 1,346
- SimpleGraph.Isostatement · cited by 99
- RelIso.reflproof · cited by 10
Cited by12
Results whose statement or proof uses this declaration.
- SimpleGraph.extremalNumber_of_fintypeCard_eqproof · cited by 3
- SimpleGraph.isTuranMaximal_turanGraphproof · cited by 1
- SimpleGraph.free_congr_leftproof · cited by 1
- SimpleGraph.free_congr_rightproof · cited by 1
- SimpleGraph.isContained_congr_leftproof · cited by 1
- SimpleGraph.isContained_congr_rightproof · cited by 1
- SimpleGraph.isContained_of_card_edgeFinsetproof · cited by 0
- SimpleGraph.Iso.comp_reflstatement · cited by 0
- SimpleGraph.Iso.connectedComponentEquiv_reflstatement and proof · cited by 0
- SimpleGraph.Iso.refl_compstatement · cited by 0
- SimpleGraph.Iso.induce_reflstatement · cited by 0
- SimpleGraph.cliqueFree_iff_top_freeproof · cited by 0