Theorems · Theorem · combinatorics
Graph.eq_bouquet_iff
∀ {α : Type u_1} {β : Type u_2} {v : α} {G : Graph α β}, G = Graph.bouquet v G.edgeSet ↔ G.vertexSet = {v}- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound
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.Subsingletonproof · cited by 276
- Graphstatement and proof · cited by 242
- Graph.vertexSetstatement and proof · cited by 87
- Graph.edgeSetstatement and proof · cited by 79
- Graph.bouquetstatement and proof · cited by 11
- Graph.vertexSet_bouquetproof · cited by 2
- Graph.eq_bouquet_of_subsingletonproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.