Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.coe_adj
∀ {V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v w : ↑G'.verts), G'.coe.Adj v w = G'.Adj ↑v ↑w- Cited by
- 12 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.Adjstatement · cited by 147
- SimpleGraph.Subgraph.coestatement and proof · cited by 89
Cited by12
Results whose statement or proof uses this declaration.
- SimpleGraph.induce_eq_coe_induce_topproof · cited by 4
- SimpleGraph.Subgraph.subgraphOfAdj_connectedproof · cited by 3
- SimpleGraph.Subgraph.edgeSet_coeproof · cited by 2
- SimpleGraph.Subgraph.map_hom_topproof · cited by 1
- SimpleGraph.exists_isTutteViolatorproof · cited by 1
- SimpleGraph.Subgraph.restrict_coeSubgraphproof · cited by 1
- SimpleGraph.Subgraph.deleteVerts_mono'proof · cited by 1
- SimpleGraph.nonempty_hom_of_forall_finite_subgraph_homproof · cited by 0
- SimpleGraph.Subgraph.deleteEdges_coe_eqproof · cited by 0
- SimpleGraph.copyCount_botproof · cited by 0
- SimpleGraph.Subgraph.coe_deleteEdges_eqproof · cited by 0
- SimpleGraph.Subgraph.coe_deleteEdges_leproof · cited by 0