Theorems · Inductive type · combinatorics
Graph.IsClosedSubgraph
{α : Type u_1} → {β : Type u_2} → Graph α β → Graph α β → PropH ≤c G (Graph.IsClosedSubgraph) is a union of components of G.
- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 17 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 by19
Results whose statement or proof uses this declaration.
- Graph.IsClosedSubgraph.isInducedSubgraphstatement and proof · cited by 6
- Graph.IsClosedSubgraph.isLink_congrstatement and proof · cited by 3
- Graph.IsClosedSubgraph.mk'statement · cited by 3
- Graph.IsClosedSubgraph.closedstatement and proof · cited by 2
- Graph.IsClosedSubgraph.inc_congrstatement and proof · cited by 2
- Graph.IsClosedSubgraph.mem_iff_of_isLinkstatement and proof · cited by 2
- Graph.IsClosedSubgraph.casesOnstatement and proof · cited by 1
- Graph.IsClosedSubgraph.mem_iff_of_adjstatement and proof · cited by 1
- Graph.IsClosedSubgraph.rflstatement · cited by 1
- Graph.IsInducedSubgraph.not_isClosedSubgraph_iff_exists_adjstatement and proof · cited by 1
- Graph.IsClosedSubgraph.adj_congrstatement and proof · cited by 0
- Graph.IsClosedSubgraph.anti_rightstatement and proof · cited by 0