Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.adj_sub
∀ {V : Type u} {G : SimpleGraph V} (self : G.Subgraph) {v w : V}, self.Adj v w → G.Adj v w- Cited by
- 19 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
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 · cited by 1,346
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.Adjstatement · cited by 147
Cited by20
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.neighborSet_subsetproof · cited by 4
- SimpleGraph.Subgraph.edgeSet_subsetproof · cited by 3
- SimpleGraph.Subgraph.Adj.adj_subproof · cited by 3
- SimpleGraph.Subgraph.spanningHomproof · cited by 2
- SimpleGraph.subgraphOfAdj_le_of_adjstatement · cited by 2
- SimpleGraph.Subgraph.coe_adj_subproof · cited by 1
- SimpleGraph.Walk.map_mapToSubgraph_eq_inducestatement · cited by 1
- SimpleGraph.IsBipartiteWith.subgraphproof · cited by 1
- SimpleGraph.Subgraph.IsMatching.induce_connectedComponentproof · cited by 1
- SimpleGraph.Subgraph.sInf_adj_of_nonemptyproof · cited by 1
- SimpleGraph.ConnectedComponent.odd_matches_node_outsideproof · cited by 1
- SimpleGraph.IsClique.of_induceproof · cited by 1