Theorems · Theorem · combinatorics
SimpleGraph.IsClique.mono
∀ {α : Type u_1} {G H : SimpleGraph α} {s : Set α}, G ≤ H → G.IsClique s → H.IsClique s- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 8 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.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.IsCliquestatement · cited by 76
- Set.Pairwise.mono'proof · cited by 17
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.IsNClique.monoproof · cited by 4
- SimpleGraph.isClique_sup_edge_of_ne_sdiffproof · cited by 1