Loogle!
Result
Found 3606 declarations mentioning SimpleGraph. Of these, only the first 200 are shown.
- SimpleGraph π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : Type u - SimpleGraph.completeGraph π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : SimpleGraph V - SimpleGraph.emptyGraph π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : SimpleGraph V - SimpleGraph.completeAtomicBooleanAlgebra π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : CompleteAtomicBooleanAlgebra (SimpleGraph V) - SimpleGraph.distribLattice π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : DistribLattice (SimpleGraph V) - SimpleGraph.infSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : InfSet (SimpleGraph V) - SimpleGraph.instCompl π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Compl (SimpleGraph V) - SimpleGraph.instInhabited π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : Inhabited (SimpleGraph V) - SimpleGraph.instLE π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : LE (SimpleGraph V) - SimpleGraph.instMax π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Max (SimpleGraph V) - SimpleGraph.instMin π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Min (SimpleGraph V) - SimpleGraph.instPartialOrder π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : PartialOrder (SimpleGraph V) - SimpleGraph.sdiff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : SDiff (SimpleGraph V) - SimpleGraph.supSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : SupSet (SimpleGraph V) - SimpleGraph.IsIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : Prop - SimpleGraph.IsUniversal π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : Prop - SimpleGraph.support π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : Set V - completeBipartiteGraph π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u_1) (W : Type u_2) : SimpleGraph (V β W) - SimpleGraph.Adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (self : SimpleGraph V) : V β V β Prop - SimpleGraph.IsSubgraph π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (x y : SimpleGraph V) : Prop - SimpleGraph.edgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : Set (Sym2 V) - SimpleGraph.fromEdgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (s : Set (Sym2 V)) : SimpleGraph V - SimpleGraph.fromRel π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (r : V β V β Prop) : SimpleGraph V - SimpleGraph.instFinite π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Finite V] : Finite (SimpleGraph V) - SimpleGraph.instInfinite π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Infinite V] : Infinite (SimpleGraph V) - SimpleGraph.instNontrivial π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Nontrivial V] : Nontrivial (SimpleGraph V) - SimpleGraph.neighborSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : Set V - SimpleGraph.uniqueOfSubsingleton π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Subsingleton V] : Unique (SimpleGraph V) - SimpleGraph.commonNeighbors π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : Set V - SimpleGraph.incidenceSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : Set (Sym2 V) - SimpleGraph.nontrivial_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Nontrivial (SimpleGraph V) β Nontrivial V - SimpleGraph.subsingleton_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Subsingleton (SimpleGraph V) β Subsingleton V - instFintypeSimpleGraphOfDecidableEq π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Fintype V] [DecidableEq V] : Fintype (SimpleGraph V) - SimpleGraph.IsCompleteBetween π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (s t : Set V) : Prop - SimpleGraph.loopless π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (self : SimpleGraph V) : Std.Irrefl self.Adj - SimpleGraph.symm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (self : SimpleGraph V) : Std.Symm self.Adj - SimpleGraph.adj_injective π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Function.Injective SimpleGraph.Adj - SimpleGraph.edgeSet_injective π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Function.Injective SimpleGraph.edgeSet - SimpleGraph.irrefl π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : Β¬G.Adj v v - SimpleGraph.IsIsolated.of_subsingleton π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Subsingleton V] (G : SimpleGraph V) (v : V) : G.IsIsolated v - SimpleGraph.IsUniversal.of_subsingleton π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} [Subsingleton V] : G.IsUniversal v - SimpleGraph.nontrivial_of_not_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} (h : Β¬G.IsIsolated v) : Nontrivial V - SimpleGraph.edgeSetEmbedding π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u_2) : SimpleGraph V βͺo Set (Sym2 V) - SimpleGraph.fromEdgeSet_edgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : SimpleGraph.fromEdgeSet G.edgeSet = G - SimpleGraph.Adj.nontrivial π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {u v : V} (hadj : G.Adj u v) : Nontrivial V - SimpleGraph.neighborSet_ne_univ π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.neighborSet v β Set.univ - SimpleGraph.ne_of_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {a b : V} (h : G.Adj a b) : a β b - SimpleGraph.Adj.ne π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {a b : V} (h : G.Adj a b) : a β b - SimpleGraph.Adj.ne' π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {a b : V} (h : G.Adj a b) : b β a - SimpleGraph.adj_symm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {u v : V} (h : G.Adj u v) : G.Adj v u - SimpleGraph.Adj.not_isIsolated_left π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) : Β¬G.IsIsolated u - SimpleGraph.Adj.not_isIsolated_right π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) : Β¬G.IsIsolated v - SimpleGraph.Adj.symm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) : G.Adj v u - SimpleGraph.adj_comm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (u v : V) : G.Adj u v β G.Adj v u - SimpleGraph.mk π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Adj : V β V β Prop) (symm : Std.Symm Adj := by aesop_graph) (loopless : Std.Irrefl Adj := by aesop_graph) : SimpleGraph V - SimpleGraph.neighborSet_nonempty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : (G.neighborSet v).Nonempty β Β¬G.IsIsolated v - SimpleGraph.neighborSet_subset_support π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.neighborSet v β G.support - SimpleGraph.notMem_neighborSet_self π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {a : V} : a β G.neighborSet a - SimpleGraph.support_of_subsingleton π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [Subsingleton V] : G.support = β - SimpleGraph.IsIsolated.not_isUniversal π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} [Nontrivial V] (h : G.IsIsolated v) (w : V) : Β¬G.IsUniversal w - SimpleGraph.IsUniversal.not_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} [Nontrivial V] (h : G.IsUniversal v) (w : V) : Β¬G.IsIsolated w - SimpleGraph.symm_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{ΞΉ : Sort u_1} {V : Type u} (G : SimpleGraph V) (f : ΞΉ β V) : Std.Symm fun i j => G.Adj (f i) (f j) - SimpleGraph.IsCompleteBetween.symm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {s t : Set V} : G.IsCompleteBetween s t β G.IsCompleteBetween t s - SimpleGraph.IsIsolated.of_isUniversal_compl π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : GαΆ.IsUniversal v β G.IsIsolated v - SimpleGraph.IsUniversal.of_isIsolated_compl π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : GαΆ.IsIsolated v β G.IsUniversal v - SimpleGraph.commonNeighbors_symm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : G.commonNeighbors v w = G.commonNeighbors w v - SimpleGraph.exists_adj_iff_not_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : (β u, G.Adj v u) β Β¬G.IsIsolated v - SimpleGraph.incidenceSet_subset π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.incidenceSet v β G.edgeSet - SimpleGraph.isCompleteBetween_comm π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {s t : Set V} : G.IsCompleteBetween s t β G.IsCompleteBetween t s - SimpleGraph.isIsolated_compl_iff_isUniversal π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : GαΆ.IsIsolated v β G.IsUniversal v - SimpleGraph.isUniversal_compl_iff_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : GαΆ.IsUniversal v β G.IsIsolated v - SimpleGraph.notMem_commonNeighbors_left π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : v β G.commonNeighbors v w - SimpleGraph.notMem_commonNeighbors_right π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : w β G.commonNeighbors v w - SimpleGraph.commonNeighbors_subset_neighborSet_left π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : G.commonNeighbors v w β G.neighborSet v - SimpleGraph.commonNeighbors_subset_neighborSet_right π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : G.commonNeighbors v w β G.neighborSet w - SimpleGraph.fintypeEdgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [Fintype (Sym2 V)] [DecidableRel G.Adj] : Fintype βG.edgeSet - SimpleGraph.iUnion_incidenceSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : β v, G.incidenceSet v = G.edgeSet - SimpleGraph.isIsolated_bot π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {v : V} : β₯.IsIsolated v - SimpleGraph.nonempty_neighborSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : (G.neighborSet v).Nonempty β β u, G.Adj v u - SimpleGraph.IsIsolated.bot π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {v : V} : β₯.IsIsolated v - SimpleGraph.IsUniversal.top π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {v : V} : β€.IsUniversal v - SimpleGraph.completeGraph_eq_top π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : SimpleGraph.completeGraph V = β€ - SimpleGraph.emptyGraph_eq_bot π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : SimpleGraph.emptyGraph V = β₯ - SimpleGraph.ext π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {x y : SimpleGraph V} (Adj : x.Adj = y.Adj) : x = y - SimpleGraph.incidenceSetEquivNeighborSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] (v : V) : β(G.incidenceSet v) β β(G.neighborSet v) - SimpleGraph.mem_support_iff_not_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : v β G.support β Β¬G.IsIsolated v - SimpleGraph.notMem_support_iff_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : v β G.support β G.IsIsolated v - SimpleGraph.Adj.left_mem_support π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {u v : V} (hadj : G.Adj u v) : u β G.support - SimpleGraph.Adj.mem_support_left π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {u v : V} (hadj : G.Adj u v) : u β G.support - SimpleGraph.Adj.mem_support_right π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {u v : V} (hadj : G.Adj u v) : v β G.support - SimpleGraph.Adj.right_mem_support π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {u v : V} (hadj : G.Adj u v) : v β G.support - SimpleGraph.Bot.adjDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : DecidableRel β₯.Adj - SimpleGraph.IsIsolated.neighborSet_eq_empty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : G.IsIsolated v β G.neighborSet v = β - SimpleGraph.IsIsolated.of_neighborSet_eq_empty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : G.neighborSet v = β β G.IsIsolated v - SimpleGraph.adj_inj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G H : SimpleGraph V} : G.Adj = H.Adj β G = H - SimpleGraph.edgeSet_inj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {Gβ Gβ : SimpleGraph V} : Gβ.edgeSet = Gβ.edgeSet β Gβ = Gβ - SimpleGraph.ext_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {x y : SimpleGraph V} : x = y β x.Adj = y.Adj - SimpleGraph.fintypeEdgeSetBot π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : Fintype ββ₯.edgeSet - SimpleGraph.ne_of_adj_of_not_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v w x : V} (h : G.Adj v x) (hn : Β¬G.Adj w x) : v β w - SimpleGraph.neighborSet_eq_empty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : G.neighborSet v = β β G.IsIsolated v - SimpleGraph.edgeSet_subset_compl_diagSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : G.edgeSet β Sym2.diagSetαΆ - SimpleGraph.mem_neighborSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : w β G.neighborSet v β G.Adj v w - SimpleGraph.not_isDiag_of_mem_edgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {e : Sym2 V} : e β G.edgeSet β Β¬e.IsDiag - SimpleGraph.not_mem_edgeSet_of_isDiag π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {e : Sym2 V} : e.IsDiag β e β G.edgeSet - SimpleGraph.Compl.adjDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] : DecidableRel GαΆ.Adj - SimpleGraph.Top.adjDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) [DecidableEq V] : DecidableRel β€.Adj - Sym2.IsDiag.not_mem_edgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {e : Sym2 V} : e.IsDiag β e β G.edgeSet - SimpleGraph.bot_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (v w : V) : β₯.Adj v w β False - SimpleGraph.default_def π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) : default = β₯ - SimpleGraph.fromEdgeSet_univ π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : SimpleGraph.fromEdgeSet Set.univ = β€ - SimpleGraph.mem_support π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : v β G.support β β w, G.Adj v w - SimpleGraph.otherVertexOfIncident π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] {v : V} {e : Sym2 V} (h : e β G.incidenceSet v) : V - SimpleGraph.support_mono π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G G' : SimpleGraph V} (h : G β€ G') : G.support β G'.support - SimpleGraph.support_top_of_nontrivial π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Nontrivial V] : β€.support = Set.univ - SimpleGraph.neighborSet.memDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) [DecidableRel G.Adj] : DecidablePred fun x => x β G.neighborSet v - SimpleGraph.edgeSet_mono π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {Gβ Gβ : SimpleGraph V} : Gβ β€ Gβ β Gβ.edgeSet β Gβ.edgeSet - SimpleGraph.insert_neighborSet_eq_univ π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : insert v (G.neighborSet v) = Set.univ β G.IsUniversal v - SimpleGraph.le_iff_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G H : SimpleGraph V} : G β€ H β β (v w : V), G.Adj v w β H.Adj v w - SimpleGraph.neighborSet_subset_compl π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.neighborSet v β {v}αΆ - SimpleGraph.support_bot π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : β₯.support = β - SimpleGraph.commonNeighbors_eq π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : G.commonNeighbors v w = G.neighborSet v β© G.neighborSet w - SimpleGraph.decidableMemCommonNeighbors π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableRel G.Adj] (v w : V) : DecidablePred fun x => x β G.commonNeighbors v w - SimpleGraph.edgeSet_subset_edgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {Gβ Gβ : SimpleGraph V} : Gβ.edgeSet β Gβ.edgeSet β Gβ β€ Gβ - SimpleGraph.neighborSet_mono π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G G' : SimpleGraph V} (hle : G β€ G') (v : V) : G.neighborSet v β G'.neighborSet v - SimpleGraph.top_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (v w : V) : β€.Adj v w β v β w - SimpleGraph.compl_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : GαΆ.Adj v w β v β w β§ Β¬G.Adj v w - SimpleGraph.decidableMemEdgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableRel G.Adj] : DecidablePred fun x => x β G.edgeSet - SimpleGraph.eq_bot_iff_isIsolated π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : G = β₯ β β (v : V), G.IsIsolated v - SimpleGraph.eq_top_iff_forall_isUniversal π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G = β€ β β (v : V), G.IsUniversal v - SimpleGraph.fromEdgeSet_empty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : SimpleGraph.fromEdgeSet β = β₯ - SimpleGraph.fromEdgeSet_mono π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {s t : Set (Sym2 V)} (h : s β t) : SimpleGraph.fromEdgeSet s β€ SimpleGraph.fromEdgeSet t - SimpleGraph.le_fromEdgeSet_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (s : Set (Sym2 V)) : G β€ SimpleGraph.fromEdgeSet s β G.edgeSet β s - SimpleGraph.mem_edgeSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v w : V} : s(v, w) β G.edgeSet β G.Adj v w - SimpleGraph.neighborSet_bot π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {v : V} : β₯.neighborSet v = β - SimpleGraph.IsUniversal.neighborSet_eq π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : G.IsUniversal v β G.neighborSet v = {v}αΆ - SimpleGraph.IsUniversal.of_neighborSet_eq π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : G.neighborSet v = {v}αΆ β G.IsUniversal v - SimpleGraph.edgeSet_bot π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : β₯.edgeSet = β - SimpleGraph.edgeSet_nonempty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G.edgeSet.Nonempty β G β β₯ - SimpleGraph.edgeSet_sSup π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {s : Set (SimpleGraph V)} : (sSup s).edgeSet = ββ (SimpleGraph.edgeSet '' s) - SimpleGraph.edgeSet_subset_sym2_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {s : Set V} : G.edgeSet β s.sym2 β G.support β s - SimpleGraph.fromEdgeSet_sInter π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {s : Set (Set (Sym2 V))} : SimpleGraph.fromEdgeSet (ββ s) = sInf (SimpleGraph.fromEdgeSet '' s) - SimpleGraph.fromEdgeSet_sUnion π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {s : Set (Set (Sym2 V))} : SimpleGraph.fromEdgeSet (ββ s) = sSup (SimpleGraph.fromEdgeSet '' s) - SimpleGraph.mem_incidenceSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v w : V) : s(v, w) β G.incidenceSet v β G.Adj v w - SimpleGraph.mk'_mem_incidenceSet_left_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {a b : V} : s(a, b) β G.incidenceSet a β G.Adj a b - SimpleGraph.mk'_mem_incidenceSet_right_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {a b : V} : s(a, b) β G.incidenceSet b β G.Adj a b - SimpleGraph.neighborSet_eq_compl_singleton π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : G.neighborSet v = {v}αΆ β G.IsUniversal v - SimpleGraph.adj_congr_of_sym2 π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {u v w x : V} (h : s(u, v) = s(w, x)) : G.Adj u v β G.Adj w x - SimpleGraph.commonNeighbors_bot_eq π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {u v : V} : β₯.commonNeighbors u v = β - SimpleGraph.edgeSet_iSup π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {ΞΉ : Sort u_2} {f : ΞΉ β SimpleGraph V} : (β¨ i, f i).edgeSet = β i, (f i).edgeSet - SimpleGraph.fromEdgeSet_iInter π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {ΞΉ : Sort u_2} {f : ΞΉ β Set (Sym2 V)} : SimpleGraph.fromEdgeSet (β i, f i) = β¨ i, SimpleGraph.fromEdgeSet (f i) - SimpleGraph.fromEdgeSet_iUnion π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {ΞΉ : Sort u_2} {f : ΞΉ β Set (Sym2 V)} : SimpleGraph.fromEdgeSet (β i, f i) = β¨ i, SimpleGraph.fromEdgeSet (f i) - SimpleGraph.fromEdgeSet_not_isDiag π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : SimpleGraph.fromEdgeSet Sym2.diagSetαΆ = β€ - SimpleGraph.Inf.adjDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) (G H : SimpleGraph V) [DecidableRel G.Adj] [DecidableRel H.Adj] : DecidableRel (G β H).Adj - SimpleGraph.Sdiff.adjDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) (G H : SimpleGraph V) [DecidableRel G.Adj] [DecidableRel H.Adj] : DecidableRel (G \ H).Adj - SimpleGraph.Sup.adjDecidable π Mathlib.Combinatorics.SimpleGraph.Basic
(V : Type u) (G H : SimpleGraph V) [DecidableRel G.Adj] [DecidableRel H.Adj] : DecidableRel (G β H).Adj - SimpleGraph.edgeSet_top π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : β€.edgeSet = Sym2.diagSetαΆ - SimpleGraph.eq_bot_iff_forall_not_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G = β₯ β β (a b : V), Β¬G.Adj a b - SimpleGraph.iInf_adj_of_nonempty π Mathlib.Combinatorics.SimpleGraph.Basic
{ΞΉ : Sort u_1} {V : Type u} {a b : V} [Nonempty ΞΉ] {f : ΞΉ β SimpleGraph V} : (β¨ i, f i).Adj a b β β (i : ΞΉ), (f i).Adj a b - SimpleGraph.iSup_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{ΞΉ : Sort u_1} {V : Type u} {a b : V} {f : ΞΉ β SimpleGraph V} : (β¨ i, f i).Adj a b β β i, (f i).Adj a b - SimpleGraph.inf_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (x y : SimpleGraph V) (v w : V) : (x β y).Adj v w β x.Adj v w β§ y.Adj v w - SimpleGraph.mem_commonNeighbors π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {u v w : V} : u β G.commonNeighbors v w β G.Adj v u β§ G.Adj w u - SimpleGraph.mk' π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} : { adj // (β (x y : V), adj x y = adj y x) β§ β (x : V), Β¬adj x x = true } βͺ SimpleGraph V - SimpleGraph.neighborSet_iSup π Mathlib.Combinatorics.SimpleGraph.Basic
{ΞΉ : Sort u_1} {V : Type u} {s : ΞΉ β SimpleGraph V} (v : V) : (β¨ i, s i).neighborSet v = β i, (s i).neighborSet v - SimpleGraph.sup_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (x y : SimpleGraph V) (v w : V) : (x β y).Adj v w β x.Adj v w β¨ y.Adj v w - SimpleGraph.decidableMemIncidenceSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] [DecidableRel G.Adj] (v : V) : DecidablePred fun x => x β G.incidenceSet v - SimpleGraph.edgeSet_iInf π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {ΞΉ : Sort u_2} [Nonempty ΞΉ] {f : ΞΉ β SimpleGraph V} : (β¨ i, f i).edgeSet = β i, (f i).edgeSet - SimpleGraph.edgeSet_inf π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Gβ Gβ : SimpleGraph V) : (Gβ β Gβ).edgeSet = Gβ.edgeSet β© Gβ.edgeSet - SimpleGraph.edgeSet_sdiff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Gβ Gβ : SimpleGraph V) : (Gβ \ Gβ).edgeSet = Gβ.edgeSet \ Gβ.edgeSet - SimpleGraph.edgeSet_sup π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Gβ Gβ : SimpleGraph V) : (Gβ β Gβ).edgeSet = Gβ.edgeSet βͺ Gβ.edgeSet - SimpleGraph.sdiff_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (x y : SimpleGraph V) (v w : V) : (x \ y).Adj v w β x.Adj v w β§ Β¬y.Adj v w - SimpleGraph.edgeSet_sInf π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {s : Set (SimpleGraph V)} (h : s.Nonempty) : (sInf s).edgeSet = ββ (SimpleGraph.edgeSet '' s) - SimpleGraph.fromEdgeSet_inter π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (s t : Set (Sym2 V)) : SimpleGraph.fromEdgeSet (s β© t) = SimpleGraph.fromEdgeSet s β SimpleGraph.fromEdgeSet t - SimpleGraph.fromEdgeSet_sdiff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (s t : Set (Sym2 V)) : SimpleGraph.fromEdgeSet (s \ t) = SimpleGraph.fromEdgeSet s \ SimpleGraph.fromEdgeSet t - SimpleGraph.fromEdgeSet_union π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (s t : Set (Sym2 V)) : SimpleGraph.fromEdgeSet (s βͺ t) = SimpleGraph.fromEdgeSet s β SimpleGraph.fromEdgeSet t - SimpleGraph.neighborSet_iInf π Mathlib.Combinatorics.SimpleGraph.Basic
{ΞΉ : Sort u_1} {V : Type u} [Nonempty ΞΉ] {s : ΞΉ β SimpleGraph V} (v : V) : (β¨ i, s i).neighborSet v = β i, (s i).neighborSet v - SimpleGraph.neighborSet_inf π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {Gβ Gβ : SimpleGraph V} (v : V) : (Gβ β Gβ).neighborSet v = Gβ.neighborSet v β© Gβ.neighborSet v - SimpleGraph.neighborSet_sdiff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {Gβ Gβ : SimpleGraph V} (v : V) : (Gβ \ Gβ).neighborSet v = Gβ.neighborSet v \ Gβ.neighborSet v - SimpleGraph.neighborSet_sup π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {Gβ Gβ : SimpleGraph V} (v : V) : (Gβ β Gβ).neighborSet v = Gβ.neighborSet v βͺ Gβ.neighborSet v - SimpleGraph.eq_top_iff_forall_ne_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G = β€ β β (a b : V), a β b β G.Adj a b - SimpleGraph.iInf_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{ΞΉ : Sort u_1} {V : Type u} {a b : V} {f : ΞΉ β SimpleGraph V} : (β¨ i, f i).Adj a b β (β (i : ΞΉ), (f i).Adj a b) β§ a β b - SimpleGraph.ne_bot_iff_exists_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G β β₯ β β a b, G.Adj a b - SimpleGraph.support_eq_bot_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) : G.support = β β G = β₯ - SimpleGraph.fintypeEdgeSetInf π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Gβ Gβ : SimpleGraph V) [DecidableEq V] [Fintype βGβ.edgeSet] [Fintype βGβ.edgeSet] : Fintype β(Gβ β Gβ).edgeSet - SimpleGraph.fintypeEdgeSetSdiff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Gβ Gβ : SimpleGraph V) [DecidableEq V] [Fintype βGβ.edgeSet] [Fintype βGβ.edgeSet] : Fintype β(Gβ \ Gβ).edgeSet - SimpleGraph.fintypeEdgeSetSup π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (Gβ Gβ : SimpleGraph V) [DecidableEq V] [Fintype βGβ.edgeSet] [Fintype βGβ.edgeSet] : Fintype β(Gβ β Gβ).edgeSet - SimpleGraph.mem_incidence_iff_neighbor π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v w : V} : s(v, w) β G.incidenceSet v β w β G.neighborSet v - SimpleGraph.neighborSet_top π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {v : V} : β€.neighborSet v = {v}αΆ - SimpleGraph.edgeSet_eq_empty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G.edgeSet = β β G = β₯ - SimpleGraph.fromEdgeSet_le π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {s : Set (Sym2 V)} : SimpleGraph.fromEdgeSet s β€ G β s \ Sym2.diagSet β G.edgeSet - SimpleGraph.isIsolated_iff_forall_edgeSet_notMem π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : G.IsIsolated v β β e β G.edgeSet, v β e - SimpleGraph.neighborSet_compl π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : GαΆ.neighborSet v = (G.neighborSet v)αΆ \ {v} - SimpleGraph.neighborSet_union_compl_neighborSet_eq π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.neighborSet v βͺ GαΆ.neighborSet v = {v}αΆ - SimpleGraph.edge_other_ne π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {e : Sym2 V} (he : e β G.edgeSet) {v : V} (h : v β e) : Sym2.Mem.other h β v - SimpleGraph.incidence_other_prop π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] {v : V} {e : Sym2 V} (h : e β G.incidenceSet v) : G.otherVertexOfIncident h β G.neighborSet v - SimpleGraph.mk'_mem_incidenceSet_iff π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {a b c : V} : s(b, c) β G.incidenceSet a β G.Adj b c β§ (a = b β¨ a = c) - SimpleGraph.ne_top_iff_exists_not_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} : G β β€ β β a b, a β b β§ Β¬G.Adj a b - SimpleGraph.sInf_adj_of_nonempty π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {a b : V} {s : Set (SimpleGraph V)} (hs : s.Nonempty) : (sInf s).Adj a b β β G β s, G.Adj a b - SimpleGraph.sSup_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {s : Set (SimpleGraph V)} {a b : V} : (sSup s).Adj a b β β G β s, G.Adj a b - SimpleGraph.sInf_adj π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {a b : V} {s : Set (SimpleGraph V)} : (sInf s).Adj a b β (β G β s, G.Adj a b) β§ a β b - SimpleGraph.edgeSet_sdiff_sdiff_isDiag π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (s : Set (Sym2 V)) : G.edgeSet \ (s \ Sym2.diagSet) = G.edgeSet \ s
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59