Loogle!
Result
Found 106 declarations mentioning SimpleGraph.ConnectedComponent.
- SimpleGraph.ConnectedComponent π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} (G : SimpleGraph V) : Type u - SimpleGraph.connectedComponentMk π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} (G : SimpleGraph V) (v : V) : G.ConnectedComponent - SimpleGraph.ConnectedComponent.instSetLike π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} : SetLike G.ConnectedComponent V - SimpleGraph.ConnectedComponent.supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : Set V - SimpleGraph.ConnectedComponent.inhabited π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [Inhabited V] : Inhabited G.ConnectedComponent - SimpleGraph.ConnectedComponent.instFinite π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [Finite V] : Finite G.ConnectedComponent - SimpleGraph.ConnectedComponent.instNonempty π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [Nonempty V] : Nonempty G.ConnectedComponent - SimpleGraph.ConnectedComponent.instSubsingleton π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [Subsingleton V] : Subsingleton G.ConnectedComponent - SimpleGraph.ConnectedComponent.instUnique π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [Unique V] : Unique G.ConnectedComponent - SimpleGraph.ConnectedComponent.isEmpty π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [IsEmpty V] : IsEmpty G.ConnectedComponent - SimpleGraph.Preconnected.subsingleton_connectedComponent π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (h : G.Preconnected) : Subsingleton G.ConnectedComponent - SimpleGraph.ConnectedComponent.nonempty_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : C.supp.Nonempty - SimpleGraph.ConnectedComponent.supp_injective π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} : Function.Injective SimpleGraph.ConnectedComponent.supp - SimpleGraph.ConnectedComponent.map π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G.ConnectedComponent) : G'.ConnectedComponent - SimpleGraph.ConnectedComponent.ind π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {Ξ² : G.ConnectedComponent β Prop} (h : β (v : V), Ξ² (G.connectedComponentMk v)) (c : G.ConnectedComponent) : Ξ² c - SimpleGraph.Iso.connectedComponentEquiv π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') : G.ConnectedComponent β G'.ConnectedComponent - SimpleGraph.ConnectedComponent.forall π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {p : G.ConnectedComponent β Prop} : (β (c : G.ConnectedComponent), p c) β β (v : V), p (G.connectedComponentMk v) - SimpleGraph.iUnion_connectedComponentSupp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} (G : SimpleGraph V) : β c, c.supp = Set.univ - SimpleGraph.ConnectedComponent.map_id π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : SimpleGraph.ConnectedComponent.map SimpleGraph.Hom.id C = C - SimpleGraph.ConnectedComponent.connectedComponentMk_eq_of_adj π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} (a : G.Adj v w) : G.connectedComponentMk v = G.connectedComponentMk w - SimpleGraph.ConnectedComponent.connectedComponentMk_mem π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v : V} : v β G.connectedComponentMk v - SimpleGraph.ConnectedComponent.exact π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} : G.connectedComponentMk v = G.connectedComponentMk w β G.Reachable v w - SimpleGraph.ConnectedComponent.sound π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} : G.Reachable v w β G.connectedComponentMk v = G.connectedComponentMk w - SimpleGraph.ConnectedComponent.eq π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} : G.connectedComponentMk v = G.connectedComponentMk w β G.Reachable v w - SimpleGraph.ConnectedComponent.inhabited_default π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} [Inhabited V] : default = G.connectedComponentMk default - SimpleGraph.Iso.connectedComponentEquiv_refl π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} : SimpleGraph.Iso.refl.connectedComponentEquiv = Equiv.refl G.ConnectedComponent - SimpleGraph.ConnectedComponent.exists π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {p : G.ConnectedComponent β Prop} : (β c, p c) β β v, p (G.connectedComponentMk v) - SimpleGraph.ConnectedComponent.maximal_connected_induce_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : Maximal (fun x => (SimpleGraph.induce x G).Connected) C.supp - SimpleGraph.ConnectedComponent.toSimpleGraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : SimpleGraph β₯C - SimpleGraph.ConnectedComponent.supp_inj π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {C D : G.ConnectedComponent} : C.supp = D.supp β C = D - SimpleGraph.ConnectedComponent.supp_injective_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {aβ aβ : G.ConnectedComponent} : aβ = aβ β aβ.supp = aβ.supp - SimpleGraph.ConnectedComponent.mem_supp_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) (v : V) : v β C.supp β G.connectedComponentMk v = C - SimpleGraph.ConnectedComponent.connected_toSimpleGraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : C.toSimpleGraph.Connected - SimpleGraph.ConnectedComponent.lift π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {Ξ² : Sort u_1} (f : V β Ξ²) (h : β (v w : V) (p : G.Walk v w), p.IsPath β f v = f w) : G.ConnectedComponent β Ξ² - SimpleGraph.ConnectedComponent.surjective_map_ofLE π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G G' : SimpleGraph V} (h : G β€ G') : Function.Surjective (SimpleGraph.ConnectedComponent.map (SimpleGraph.Hom.ofLE h)) - SimpleGraph.ConnectedComponent.indβ π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {Ξ² : G.ConnectedComponent β G.ConnectedComponent β Prop} (h : β (v w : V), Ξ² (G.connectedComponentMk v) (G.connectedComponentMk w)) (c d : G.ConnectedComponent) : Ξ² c d - SimpleGraph.ConnectedComponent.toSimpleGraph_hom π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : C.toSimpleGraph βg G - SimpleGraph.ConnectedComponent.mem_supp_of_adj_mem_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) {u v : V} (hu : u β C.supp) (hadj : G.Adj u v) : v β C.supp - SimpleGraph.ConnectedComponent.reachable_of_mem_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) {u v : V} (hu : u β C.supp) (hv : v β C.supp) : G.Reachable u v - SimpleGraph.ConnectedComponent.mem_supp_congr_adj π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} (c : G.ConnectedComponent) (hadj : G.Adj v w) : v β c.supp β w β c.supp - SimpleGraph.ConnectedComponent.maximal_connected_induce_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (s : Set V) : Maximal (fun x => (SimpleGraph.induce x G).Connected) s β β C, C.supp = s - SimpleGraph.ConnectedComponent.eq_of_common_vertex π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v : V} {c c' : G.ConnectedComponent} (hc : v β c.supp) (hc' : v β c'.supp) : c = c' - SimpleGraph.homOfConnectedComponents π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} (G : SimpleGraph V) {H : SimpleGraph V'} (C : (c : G.ConnectedComponent) β c.toSimpleGraph βg H) : G βg H - SimpleGraph.ConnectedComponent.top_supp_eq_univ π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} (c : β€.ConnectedComponent) : c.supp = Set.univ - SimpleGraph.ConnectedComponent.connectedComponentMk_supp_subset_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G G' : SimpleGraph V} {v : V} (h : G β€ G') (c' : G'.ConnectedComponent) (hc' : v β c'.supp) : (G.connectedComponentMk v).supp β c'.supp - SimpleGraph.Iso.connectedComponentEquiv_symm π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') : Ο.symm.connectedComponentEquiv = Ο.connectedComponentEquiv.symm - SimpleGraph.ConnectedComponent.adj_spanningCoe_toSimpleGraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {v w : V} (C : G.ConnectedComponent) : C.toSimpleGraph.spanningCoe.Adj v w β v β C.supp β§ G.Adj v w - SimpleGraph.ConnectedComponent.map_mk π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (v : V) : SimpleGraph.ConnectedComponent.map Ο (G.connectedComponentMk v) = G'.connectedComponentMk (Ο v) - SimpleGraph.ConnectedComponent.map_comp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {V'' : Type w} {G : SimpleGraph V} {G' : SimpleGraph V'} {G'' : SimpleGraph V''} (C : G.ConnectedComponent) (Ο : G βg G') (Ο : G' βg G'') : SimpleGraph.ConnectedComponent.map Ο (SimpleGraph.ConnectedComponent.map Ο C) = SimpleGraph.ConnectedComponent.map (Ο.comp Ο) C - SimpleGraph.pairwise_disjoint_supp_connectedComponent π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} (G : SimpleGraph V) : Pairwise fun c c' => Disjoint c.supp c'.supp - SimpleGraph.ConnectedComponent.biUnion_supp_eq_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G G' : SimpleGraph V} (h : G β€ G') (c' : G'.ConnectedComponent) : β c, β (_ : c.supp β c'.supp), c.supp = c'.supp - SimpleGraph.Iso.connectedComponentEquiv_trans π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {V'' : Type w} {G : SimpleGraph V} {G' : SimpleGraph V'} {G'' : SimpleGraph V''} (Ο : G βg G') (Ο' : G' βg G'') : SimpleGraph.Iso.connectedComponentEquiv (RelIso.trans Ο Ο') = Ο.connectedComponentEquiv.trans Ο'.connectedComponentEquiv - SimpleGraph.ConnectedComponent.isoEquivSupp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G.ConnectedComponent) : βC.supp β β(Ο.connectedComponentEquiv C).supp - SimpleGraph.ConnectedComponent.iso_image_comp_eq_map_iff_eq_comp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} {Ο : G βg G'} {v : V} {C : G.ConnectedComponent} : G'.connectedComponentMk (Ο v) = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο).toRelHom C β G.connectedComponentMk v = C - SimpleGraph.ConnectedComponent.recOn π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {motive : G.ConnectedComponent β Sort u_1} (c : G.ConnectedComponent) (f : (v : V) β motive (G.connectedComponentMk v)) (h : β (u v : V) (p : G.Walk u v), p.IsPath β β― βΈ f u = f v) : motive c - SimpleGraph.ConnectedComponent.iso_inv_image_comp_eq_iff_eq_map π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} {Ο : G βg G'} {v' : V'} {C : G.ConnectedComponent} : G.connectedComponentMk (Ο.symm v') = C β G'.connectedComponentMk v' = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο).toRelHom C - SimpleGraph.Iso.connectedComponentEquiv_apply π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G.ConnectedComponent) : Ο.connectedComponentEquiv C = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο).toRelHom C - SimpleGraph.Iso.connectedComponentEquiv_symm_apply π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G'.ConnectedComponent) : Ο.connectedComponentEquiv.symm C = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο.symm).toRelHom C - SimpleGraph.ConnectedComponent.reachable_toSimpleGraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) {u v : V} (hu : u β C) (hv : v β C) : C.toSimpleGraph.Reachable β¨u, huβ© β¨v, hvβ© - SimpleGraph.ConnectedComponent.toSimpleGraph_adj π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) {u v : V} (hu : u β C) (hv : v β C) : C.toSimpleGraph.Adj β¨u, huβ© β¨v, hvβ© β G.Adj u v - 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.ConnectedComponent.toSimpleGraph_hom_apply π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) (u : β₯C) : C.toSimpleGraph_hom u = βu - SimpleGraph.homOfConnectedComponents_apply π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} (G : SimpleGraph V) {H : SimpleGraph V'} (C : (c : G.ConnectedComponent) β c.toSimpleGraph βg H) (x : V) : (G.homOfConnectedComponents C) x = (C (G.connectedComponentMk x)) β¨x, β―β© - SimpleGraph.colorable_iff_forall_connectedComponent π Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
{V : Type u} {G : SimpleGraph V} {n : β} : G.Colorable n β β (c : G.ConnectedComponent), c.toSimpleGraph.Colorable n - SimpleGraph.colorable_iff_forall_connectedComponents π Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
{V : Type u} {G : SimpleGraph V} {n : β} : G.Colorable n β β (c : G.ConnectedComponent), c.toSimpleGraph.Colorable n - SimpleGraph.ConnectedComponent.toSubgraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : G.Subgraph - SimpleGraph.ConnectedComponent.connected_toSubgraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : C.toSubgraph.Connected - SimpleGraph.ConnectedComponent.coe_toSubgraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : C.toSubgraph.coe = C.toSimpleGraph - SimpleGraph.ConnectedComponent.maximal_connected_toSubgraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : Maximal SimpleGraph.Subgraph.Connected C.toSubgraph - SimpleGraph.ConnectedComponent.spanningCoe_toSubgraph π Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent) : C.toSubgraph.spanningCoe = C.toSimpleGraph.spanningCoe - SimpleGraph.ConnectedComponent.maximal_subgraph_connected_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) : Maximal SimpleGraph.Subgraph.Connected G' β β C, C.toSubgraph = G' - 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.IsAcyclic.isTree_connectedComponent π Mathlib.Combinatorics.SimpleGraph.Acyclic
{V : Type u_1} {G : SimpleGraph V} (h : G.IsAcyclic) (c : G.ConnectedComponent) : c.toSimpleGraph.IsTree - SimpleGraph.IsAcyclic.coloringTwoOfVerts π Mathlib.Combinatorics.SimpleGraph.Acyclic
{V : Type u_1} {G : SimpleGraph V} (hG : G.IsAcyclic) (verts : G.ConnectedComponent β V) (h : β (C : G.ConnectedComponent), verts C β C) : G.Coloring (Fin 2) - SimpleGraph.oddComponents π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} (G : SimpleGraph V) : Set G.ConnectedComponent - SimpleGraph.instFintypeConnectedComponent π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} (G : SimpleGraph V) [DecidableEq V] [Fintype V] [DecidableRel G.Adj] : Fintype G.ConnectedComponent - SimpleGraph.odd_ncard_oddComponents π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} (G : SimpleGraph V) [Finite V] : Odd G.oddComponents.ncard β Odd (Nat.card V) - SimpleGraph.ConnectedComponent.card_le_card_of_le π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} [Finite V] {G G' : SimpleGraph V} (h : G β€ G') : Nat.card G'.ConnectedComponent β€ Nat.card G.ConnectedComponent - SimpleGraph.instDecidableMemSupp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} (G : SimpleGraph V) [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (c : G.ConnectedComponent) (v : V) : Decidable (v β c.supp) - SimpleGraph.ncard_oddComponents_mono π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} (G : SimpleGraph V) [Finite V] {G' : SimpleGraph V} (h : G β€ G') : G'.oddComponents.ncard β€ G.oddComponents.ncard - SimpleGraph.ConnectedComponent.odd_oddComponents_ncard_subset_supp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} (G : SimpleGraph V) [Finite V] {G' : SimpleGraph V} (h : G β€ G') (c' : G'.ConnectedComponent) : Odd {c | c β G.oddComponents β§ c.supp β c'.supp}.ncard β Odd c'.supp.ncard - SimpleGraph.disjiUnion_supp_toFinset_eq_supp_toFinset π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} {G : SimpleGraph V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] {G' : SimpleGraph V} (h : G β€ G') (c' : G'.ConnectedComponent) [Fintype βc'.supp] [DecidablePred fun c => c.supp β c'.supp] : {c | c.supp β c'.supp}.disjiUnion (fun c => c.supp.toFinset) β― = c'.supp.toFinset - SimpleGraph.ConnectedComponent.Represents π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} (s : Set V) (C : Set G.ConnectedComponent) : Prop - SimpleGraph.ConnectedComponent.Represents.image_out π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} (C : Set G.ConnectedComponent) : SimpleGraph.ConnectedComponent.Represents (Quot.out '' C) C - SimpleGraph.ConnectedComponent.Represents.ncard_eq π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} (hrep : SimpleGraph.ConnectedComponent.Represents s C) : s.ncard = C.ncard - SimpleGraph.ConnectedComponent.even_ncard_supp_sdiff_rep π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {s : Set V} (K : G.ConnectedComponent) (hrep : SimpleGraph.ConnectedComponent.Represents s G.oddComponents) : Even (K.supp \ s).ncard - SimpleGraph.ConnectedComponent.Represents.ncard_inter π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent} (hrep : SimpleGraph.ConnectedComponent.Represents s C) (h : c β C) : (s β© c.supp).ncard = 1 - SimpleGraph.ConnectedComponent.Represents.existsUnique_rep π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent} (hrep : SimpleGraph.ConnectedComponent.Represents s C) (h : c β C) : β! x, x β s β© c.supp - SimpleGraph.ConnectedComponent.Represents.ncard_sdiff_of_notMem π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent} (hrep : SimpleGraph.ConnectedComponent.Represents s C) (h : c β C) : (c.supp \ s).ncard = c.supp.ncard - SimpleGraph.ConnectedComponent.Represents.exists_inter_eq_singleton π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent} (hrep : SimpleGraph.ConnectedComponent.Represents s C) (h : c β C) : β x, s β© c.supp = {x} - SimpleGraph.ConnectedComponent.Represents.ncard_sdiff_of_mem π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent} (hrep : SimpleGraph.ConnectedComponent.Represents s C) (h : c β C) : (c.supp \ s).ncard = c.supp.ncard - 1 - SimpleGraph.ConnectedComponent.Represents.disjoint_supp_of_notMem π Mathlib.Combinatorics.SimpleGraph.Connectivity.Represents
{V : Type u} {G : SimpleGraph V} {C : Set G.ConnectedComponent} {s : Set V} {c : G.ConnectedComponent} (hrep : SimpleGraph.ConnectedComponent.Represents s C) (h : c β C) : Disjoint s c.supp - SimpleGraph.Subgraph.IsPerfectMatching.induce_connectedComponent_isMatching π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} (h : M.IsPerfectMatching) (c : G.ConnectedComponent) : (M.induce c.supp).IsMatching - SimpleGraph.IsCycles.toSimpleGraph π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} (c : G.ConnectedComponent) (h : G.IsCycles) : c.toSimpleGraph.spanningCoe.IsCycles - SimpleGraph.Subgraph.IsMatching.induce_connectedComponent π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} (h : M.IsMatching) (c : G.ConnectedComponent) : (M.induce (M.verts β© c.supp)).IsMatching - SimpleGraph.ConnectedComponent.even_card_of_isPerfectMatching π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} [Fintype V] [DecidableEq V] [DecidableRel G.Adj] (c : G.ConnectedComponent) (hM : M.IsPerfectMatching) : Even (Fintype.card βc.supp) - SimpleGraph.IsCycles.exists_cycle_toSubgraph_verts_eq_connectedComponentSupp π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {v : V} [Finite V] {c : G.ConnectedComponent} (h : G.IsCycles) (hv : v β c.supp) (hn : (G.neighborSet v).Nonempty) : β p, p.IsCycle β§ p.toSubgraph.verts = c.supp - 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.lapMatrix_ker_basis_aux π Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] [DecidableEq G.ConnectedComponent] (c : G.ConnectedComponent) : β₯(Matrix.toLin' (SimpleGraph.lapMatrix β G)).ker - SimpleGraph.mem_ker_toLin'_lapMatrix_of_connectedComponent π Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} [Fintype V] [DecidableEq V] {G : SimpleGraph V} [DecidableRel G.Adj] [DecidableEq G.ConnectedComponent] (c : G.ConnectedComponent) : (fun i => if G.connectedComponentMk i = c then 1 else 0) β (Matrix.toLin' (SimpleGraph.lapMatrix β G)).ker - SimpleGraph.lapMatrix_ker_basis π Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] [DecidableEq G.ConnectedComponent] : Module.Basis G.ConnectedComponent β β₯(Matrix.toLin' (SimpleGraph.lapMatrix β G)).ker - SimpleGraph.card_connectedComponent_eq_finrank_ker_toLin'_lapMatrix π Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] : Fintype.card G.ConnectedComponent = Module.finrank β β₯(Matrix.toLin' (SimpleGraph.lapMatrix β G)).ker - SimpleGraph.linearIndependent_lapMatrix_ker_basis_aux π Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] [DecidableEq G.ConnectedComponent] : LinearIndependent β G.lapMatrix_ker_basis_aux - SimpleGraph.top_le_span_range_lapMatrix_ker_basis_aux π Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] [DecidableEq G.ConnectedComponent] : β€ β€ Submodule.span β (Set.range G.lapMatrix_ker_basis_aux) - SimpleGraph.even_ncard_image_val_supp_sdiff_image_val_rep_union π Mathlib.Combinatorics.SimpleGraph.UniversalVerts
{V : Type u_1} {G : SimpleGraph V} {t : Set V} {s : Set βG.deleteUniversalVerts.verts} (K : G.deleteUniversalVerts.coe.ConnectedComponent) (h : t β G.universalVerts) (hrep : SimpleGraph.ConnectedComponent.Represents s G.deleteUniversalVerts.coe.oddComponents) : Even (Subtype.val '' K.supp \ (Subtype.val '' s βͺ t)).ncard - SimpleGraph.Subgraph.IsPerfectMatching.exists_of_isClique_supp π Mathlib.Combinatorics.SimpleGraph.Tutte
{V : Type u_1} {G : SimpleGraph V} [Finite V] (hveven : Even (Nat.card V)) (h : Β¬G.IsTutteViolator G.universalVerts) (h' : β (K : G.deleteUniversalVerts.coe.ConnectedComponent), G.deleteUniversalVerts.coe.IsClique K.supp) : β M, M.IsPerfectMatching
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