Theorems · Inductive type · combinatorics
Graph.IsInducedSubgraph
{α : Type u_1} → {β : Type u_2} → Graph α β → Graph α β → PropH ≤i G (Graph.IsInducedSubgraph) is a subgraph of G such that every link of G
involving two vertices of H is also a link of H.
- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 16 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement · cited by 242
Cited by20
Results whose statement or proof uses this declaration.
- Graph.IsInducedSubgraph.lestatement and proof · cited by 12
- Graph.IsInducedSubgraph.isLink_of_mem_memstatement and proof · cited by 8
- Graph.IsClosedSubgraph.isInducedSubgraphstatement · cited by 6
- Graph.IsClosedSubgraph.casesOnstatement and proof · cited by 1
- Graph.IsInducedSubgraph.casesOnstatement and proof · cited by 1
- Graph.IsInducedSubgraph.not_isClosedSubgraph_iff_exists_adjstatement and proof · cited by 1
- Graph.IsInducedSubgraph.rflstatement · cited by 1
- Graph.IsClosedSubgraph.recOnstatement and proof · cited by 0
- Graph.IsInducedSubgraph.adj_congrstatement and proof · cited by 0
- Graph.IsInducedSubgraph.anti_rightstatement and proof · cited by 0
- Graph.IsInducedSubgraph.ext_of_vertexSetstatement and proof · cited by 0
- Graph.IsInducedSubgraph.isLink_congrstatement and proof · cited by 0