Loogle!
Result
Found 84 declarations mentioning SimpleGraph.Subgraph.Adj.
- SimpleGraph.Subgraph.Adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (self : G.Subgraph) : V โ V โ Prop - SimpleGraph.Subgraph.loopless ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) : Std.Irrefl G'.Adj - SimpleGraph.Subgraph.symm ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (self : G.Subgraph) : Std.Symm self.Adj - SimpleGraph.Subgraph.not_bot_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {a b : V} : ยฌโฅ.Adj a b - SimpleGraph.Subgraph.Adj.ne ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v : V} (h : H.Adj u v) : u โ v - SimpleGraph.Subgraph.adj_sub ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (self : G.Subgraph) {v w : V} : self.Adj v w โ G.Adj v w - SimpleGraph.Subgraph.Adj.adj_sub ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v : V} (h : H.Adj u v) : G.Adj u v - SimpleGraph.Subgraph.adj_symm ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) {u v : V} (h : G'.Adj u v) : G'.Adj v u - SimpleGraph.Subgraph.Adj.symm ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {u v : V} (h : G'.Adj u v) : G'.Adj v u - SimpleGraph.subgraphOfAdj_adj_self ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) : (G.subgraphOfAdj h).Adj u v - SimpleGraph.Subgraph.adj_comm ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v w : V) : G'.Adj v w โ G'.Adj w v - SimpleGraph.Subgraph.top_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {a b : V} : โค.Adj a b โ G.Adj a b - SimpleGraph.Subgraph.spanningCoe_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (aโ aโยน : V) : G'.spanningCoe.Adj aโ aโยน = G'.Adj aโ aโยน - SimpleGraph.Subgraph.edge_vert ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (self : G.Subgraph) {v w : V} : self.Adj v w โ v โ self.verts - SimpleGraph.Subgraph.Adj.fst_mem ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v : V} (h : H.Adj u v) : u โ H.verts - SimpleGraph.Subgraph.Adj.snd_mem ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v : V} (h : H.Adj u v) : v โ H.verts - SimpleGraph.Subgraph.mem_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v w : V) : w โ G'.neighborSet v โ G'.Adj v w - SimpleGraph.Subgraph.mem_support ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (H : G.Subgraph) {v : V} : v โ H.support โ โ w, H.Adj v w - SimpleGraph.Subgraph.neighborSet.decidablePred ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) [h : DecidableRel G'.Adj] (v : V) : DecidablePred fun x => x โ G'.neighborSet v - SimpleGraph.toSubgraph_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (H : SimpleGraph V) (h : H โค G) (aโ aโยน : V) : (SimpleGraph.toSubgraph H h).Adj aโ aโยน = H.Adj aโ aโยน - SimpleGraph.Subgraph.copy ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (V'' : Set V) (hV : V'' = G'.verts) (adj' : V โ V โ Prop) (hadj : adj' = G'.Adj) : G.Subgraph - SimpleGraph.Subgraph.mem_edgeSet ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {v w : V} : s(v, w) โ G'.edgeSet โ G'.Adj v w - SimpleGraph.Subgraph.spanningCoe_inj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {Gโ Gโ : G.Subgraph} : Gโ.spanningCoe = Gโ.spanningCoe โ Gโ.Adj = Gโ.Adj - SimpleGraph.Subgraph.adj_congr_of_sym2 ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v w x : V} (h2 : s(u, v) = s(w, x)) : H.Adj u v โ H.Adj w x - SimpleGraph.subgraphOfAdj_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} (G : SimpleGraph V) {v w : V} (hvw : G.Adj v w) (a b : V) : (G.subgraphOfAdj hvw).Adj a b = (s(v, w) = s(a, b)) - SimpleGraph.Subgraph.instDecidableRel_induce_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (s : Set V) [(a : V) โ Decidable (a โ s)] [DecidableRel G'.Adj] : DecidableRel (G'.induce s).Adj - SimpleGraph.singletonSubgraph_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} (G : SimpleGraph V) (v aโ aโยน : V) : (G.singletonSubgraph v).Adj aโ aโยน = โฅ aโ aโยน - SimpleGraph.Subgraph.iInf_adj_of_nonempty ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{ฮน : Sort u_1} {V : Type u} {G : SimpleGraph V} {a b : V} [Nonempty ฮน] {f : ฮน โ G.Subgraph} : (โจ i, f i).Adj a b โ โ (i : ฮน), (f i).Adj a b - SimpleGraph.Subgraph.iSup_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{ฮน : Sort u_1} {V : Type u} {G : SimpleGraph V} {a b : V} {f : ฮน โ G.Subgraph} : (โจ i, f i).Adj a b โ โ i, (f i).Adj a b - SimpleGraph.Subgraph.instDecidableRelElemVertsAdjCoeOfAdj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} (G : SimpleGraph V) (H : G.Subgraph) [DecidableRel H.Adj] : DecidableRel H.coe.Adj - SimpleGraph.Subgraph.degree_eq_one_iff_existsUnique_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {v : V} [Fintype โ(G'.neighborSet v)] : G'.degree v = 1 โ โ! w, G'.Adj v w - SimpleGraph.Subgraph.ext ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {x y : G.Subgraph} (verts : x.verts = y.verts) (Adj : x.Adj = y.Adj) : x = y - SimpleGraph.Subgraph.degree_pos_iff_exists_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {v : V} [Fintype โ(G'.neighborSet v)] : 0 < G'.degree v โ โ w, G'.Adj v w - SimpleGraph.Subgraph.inf_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {Gโ Gโ : G.Subgraph} {a b : V} : (Gโ โ Gโ).Adj a b โ Gโ.Adj a b โง Gโ.Adj a b - SimpleGraph.Subgraph.sup_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {Gโ Gโ : G.Subgraph} {a b : V} : (Gโ โ Gโ).Adj a b โ Gโ.Adj a b โจ Gโ.Adj a b - SimpleGraph.Subgraph.adj_iff_of_neighborSet_equiv ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {v : V} {H : G.Subgraph} (h : โ(G.neighborSet v) โ โ(H.neighborSet v)) (hfin : (G.neighborSet v).Finite) {w : V} : H.Adj v w โ G.Adj v w - SimpleGraph.Subgraph.ext_iff ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {x y : G.Subgraph} : x = y โ x.verts = y.verts โง x.Adj = y.Adj - SimpleGraph.Subgraph.copy_eq ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (V'' : Set V) (hV : V'' = G'.verts) (adj' : V โ V โ Prop) (hadj : adj' = G'.Adj) : G'.copy V'' hV adj' hadj = G' - SimpleGraph.Subgraph.iInf_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{ฮน : Sort u_1} {V : Type u} {G : SimpleGraph V} {a b : V} {f : ฮน โ G.Subgraph} : (โจ i, f i).Adj a b โ (โ (i : ฮน), (f i).Adj a b) โง G.Adj a b - SimpleGraph.subgraphOfAdj_le_iff ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {u v : V} (h : G.Adj u v) (H : G.Subgraph) : G.subgraphOfAdj h โค H โ H.Adj u v - SimpleGraph.subgraphOfAdj_le_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {v w : V} (H : G.Subgraph) (h : H.Adj v w) : G.subgraphOfAdj โฏ โค H - SimpleGraph.Subgraph.deleteEdges_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (s : Set (Sym2 V)) (v w : V) : (G'.deleteEdges s).Adj v w โ G'.Adj v w โง s(v, w) โ s - SimpleGraph.Subgraph.induce_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (s : Set V) (u v : V) : (G'.induce s).Adj u v = (u โ s โง v โ s โง G'.Adj u v) - SimpleGraph.Subgraph.sInf_adj_of_nonempty ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {a b : V} {s : Set G.Subgraph} (hs : s.Nonempty) : (sInf s).Adj a b โ โ G' โ s, G'.Adj a b - SimpleGraph.Subgraph.sSup_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {a b : V} {s : Set G.Subgraph} : (sSup s).Adj a b โ โ G_1 โ s, G_1.Adj a b - SimpleGraph.Subgraph.sInf_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {a b : V} {s : Set G.Subgraph} : (sInf s).Adj a b โ (โ G' โ s, G'.Adj a b) โง G.Adj a b - SimpleGraph.Subgraph.finiteAt ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (v : โG'.verts) [DecidableRel G'.Adj] [Fintype โ(G.neighborSet โv)] : Fintype โ(G'.neighborSet โv) - SimpleGraph.Subgraph.coe_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v w : โG'.verts) : G'.coe.Adj v w = G'.Adj โv โw - SimpleGraph.Subgraph.deleteVerts_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {s : Set V} {u v : V} : (G'.deleteVerts s).Adj u v โ u โ G'.verts โง u โ s โง v โ G'.verts โง v โ s โง G'.Adj u v - SimpleGraph.Subgraph.Adj.coe ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} {u v : V} (h : H.Adj u v) : H.coe.Adj โจu, โฏโฉ โจv, โฏโฉ - SimpleGraph.Subgraph.map_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (H : G.Subgraph) (aโ aโยน : W) : (SimpleGraph.Subgraph.map f H).Adj aโ aโยน = Relation.Map H.Adj (โf) (โf) aโ aโยน - SimpleGraph.Subgraph.comap_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (H : G'.Subgraph) (u v : V) : (SimpleGraph.Subgraph.comap f H).Adj u v = (G.Adj u v โง H.Adj (f u) (f v)) - SimpleGraph.Subgraph.finiteAtOfSubgraph ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' G'' : G.Subgraph} [DecidableRel G'.Adj] (h : G' โค G'') (v : โG'.verts) [Fintype โ(G''.neighborSet โv)] : Fintype โ(G'.neighborSet โv) - SimpleGraph.Subgraph.Adj.adj_sub' ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (u v : โG'.verts) (h : G'.Adj โu โv) : G.Adj โu โv - SimpleGraph.Subgraph.IsInduced.adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (hG' : G'.IsInduced) {a b : โG'.verts} : G'.Adj โa โb โ G.Adj โa โb - SimpleGraph.Subgraph.restrict_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' G'' : G.Subgraph} (v w : โG'.verts) : (SimpleGraph.Subgraph.restrict G'').Adj v w โ G'.Adj โv โw โง G''.Adj โv โw - SimpleGraph.Subgraph.coeSubgraph_adj ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (G'' : G'.coe.Subgraph) (v w : V) : (SimpleGraph.Subgraph.coeSubgraph G'').Adj v w โ โ (hv : v โ G'.verts) (hw : w โ G'.verts), G''.Adj โจv, hvโฉ โจw, hwโฉ - SimpleGraph.Subgraph.spanningCoe_sup_edge_le ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} {H : (G โ SimpleGraph.edge s t).Subgraph} (h : ยฌH.Adj s t) : H.spanningCoe โค G - SimpleGraph.Reachable.mem_subgraphVerts ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} {H : G.Subgraph} (hr : G.Reachable u v) (h : โ v โ H.verts, โ (w : V), G.Adj v w โ H.Adj v w) (hu : u โ H.verts) : v โ H.verts - SimpleGraph.ConnectedComponent.mem_coe_supp_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} {H : G.Subgraph} {c : H.coe.ConnectedComponent} (hv : v โ Subtype.val '' โc) (hw : w โ H.verts) (hadj : H.Adj v w) : w โ Subtype.val '' โc - SimpleGraph.Walk.not_nil_of_adj_toSubgraph ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {w u v x : V} {p : G.Walk u v} (hadj : p.toSubgraph.Adj w x) : ยฌp.Nil - SimpleGraph.Walk.toSubgraph_adj_penultimate ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v : V} (w : G.Walk u v) (h : ยฌw.Nil) : w.toSubgraph.Adj w.penultimate v - SimpleGraph.Walk.toSubgraph_adj_snd ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v : V} (w : G.Walk u v) (h : ยฌw.Nil) : w.toSubgraph.Adj u w.snd - SimpleGraph.Walk.mem_support_of_adj_toSubgraph ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v u' v' : V} {p : G.Walk u v} (hp : p.toSubgraph.Adj u' v') : u' โ p.support - SimpleGraph.Walk.IsPath.snd_of_toSubgraph_adj ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v v' : V} {p : G.Walk u v} (hp : p.IsPath) (hadj : p.toSubgraph.Adj u v') : p.snd = v' - SimpleGraph.Subgraph.Connected.mono' ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {H H' : G.Subgraph} (hle : โ (v w : V), H.Adj v w โ H'.Adj v w) (hv : H.verts = H'.verts) (h : H.Connected) : H'.Connected - SimpleGraph.Walk.adj_toSubgraph_iff_mem_edges ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v u' v' : V} {p : G.Walk u v} : p.toSubgraph.Adj u' v' โ s(u', v') โ p.edges - SimpleGraph.Subgraph.Preconnected.exists_adj_of_nontrivial ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} [Nontrivial โH.verts] (h : H.Preconnected) (v : โH.verts) : โ u, H.Adj (โv) u - SimpleGraph.Walk.adj_toSubgraph_mapLe ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v : V} {G' : SimpleGraph V} {w x : V} {p : G.Walk u v} (h : G โค G') : (SimpleGraph.Walk.mapLe h p).toSubgraph.Adj w x โ p.toSubgraph.Adj w x - SimpleGraph.Subgraph.Connected.exists_verts_eq_connectedComponentSupp ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {H : G.Subgraph} (hc : H.Connected) (h : โ v โ H.verts, โ (w : V), G.Adj v w โ H.Adj v w) : โ c, H.verts = c.supp - SimpleGraph.Walk.toSubgraph_adj_getVert ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v : V} (w : G.Walk u v) {i : โ} (hi : i < w.length) : w.toSubgraph.Adj (w.getVert i) (w.getVert (i + 1)) - SimpleGraph.Walk.toSubgraph_adj_iff ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {u v u' v' : V} (w : G.Walk u v) : w.toSubgraph.Adj u' v' โ โ i, s(w.getVert i, w.getVert (i + 1)) = s(u', v') โง i < w.length - SimpleGraph.Walk.IsCycle.exists_isCycle_snd_verts_eq ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} {v w : V} {p : G.Walk v v} (h : p.IsCycle) (hadj : p.toSubgraph.Adj v w) : โ p', p'.IsCycle โง p'.snd = w โง p'.toSubgraph.verts = p.toSubgraph.verts - SimpleGraph.Subgraph.isPerfectMatching_iff ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} : M.IsPerfectMatching โ โ (v : V), โ! w, M.Adj v w - SimpleGraph.Subgraph.IsMatching.eq_of_adj_left ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v w : V} (hM : M.IsMatching) (huv : M.Adj u v) (huw : M.Adj u w) : v = w - SimpleGraph.Subgraph.IsMatching.eq_of_adj_right ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v w : V} (hM : M.IsMatching) (huw : M.Adj u w) (hvw : M.Adj v w) : u = v - SimpleGraph.Subgraph.IsMatching.not_adj_left_of_ne ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v w : V} (hM : M.IsMatching) (hvw : v โ w) (huv : M.Adj u v) : ยฌM.Adj u w - SimpleGraph.Subgraph.IsMatching.not_adj_right_of_ne ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v w : V} (hM : M.IsMatching) (huv : u โ v) (huw : M.Adj u w) : ยฌM.Adj v w - SimpleGraph.Walk.IsCycle.adj_toSubgraph_iff_of_isCycles ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {v : V} [G.LocallyFinite] {u : V} {p : G.Walk u u} (hp : p.IsCycle) (hcyc : G.IsCycles) (hv : v โ p.toSubgraph.verts) (w : V) : p.toSubgraph.Adj v w โ G.Adj v w - SimpleGraph.Subgraph.IsMatching.toEdge_eq_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {v w : V} (h : M.IsMatching) (hvw : M.Adj v w) : h.toEdge โจv, โฏโฉ = โจs(v, w), hvwโฉ - SimpleGraph.Subgraph.IsMatching.toEdge_eq_toEdge_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {v w : V} (h : M.IsMatching) (ha : M.Adj v w) : h.toEdge โจv, โฏโฉ = h.toEdge โจw, โฏโฉ - SimpleGraph.Subgraph.IsMatching.toEdge_preimage_singleton ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} {u v : V} (h : M.IsMatching) (huv : M.Adj u v) : h.toEdge โปยน' {โจs(u, v), huvโฉ} = {โจu, โฏโฉ, โจv, โฏโฉ} - SimpleGraph.ConnectedComponent.odd_matches_node_outside ๐ Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} [Finite V] {u : Set V} (hM : M.IsPerfectMatching) (c : โ(โค.deleteVerts u).coe.oddComponents) : โ w โ u, โ v, M.Adj (โv) w โง v โ (โc).supp - SimpleGraph.deleteUniversalVerts_adj ๐ Mathlib.Combinatorics.SimpleGraph.UniversalVerts
{V : Type u_1} (G : SimpleGraph V) (u v : V) : G.deleteUniversalVerts.Adj u v = (u โ G.universalVerts โง v โ G.universalVerts โง G.Adj u v)
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 ce5dd8c