Theorems · Theorem · combinatorics
Graph.le_noEdge_iff
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β} {X : Set α}, G ≤ Graph.noEdge X β ↔ G.vertexSet ⊆ X ∧ G.edgeSet = ∅- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.vertexSetstatement and proof · cited by 87
- Graph.edgeSetstatement and proof · cited by 79
- Set.subset_empty_iffproof · cited by 40
- Graph.IsLink.edge_memproof · cited by 14
- Graph.IsSubgraph.vertexSet_monoproof · cited by 12
- Graph.noEdgestatement and proof · cited by 10
- Graph.IsSubgraph.edgeSet_monoproof · cited by 8
- Graph.edgeSet_noEdgeproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.