Loogle!
Result
Found 264 declarations mentioning SimpleGraph.neighborSet. Of these, only the first 200 are shown.
- SimpleGraph.neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : Set V - SimpleGraph.neighborSet_ne_univ ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.neighborSet v โ Set.univ - 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.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.nonempty_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : (G.neighborSet v).Nonempty โ โ u, G.Adj v u - SimpleGraph.incidenceSetEquivNeighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] (v : V) : โ(G.incidenceSet v) โ โ(G.neighborSet v) - 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.neighborSet_eq_empty ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) {v : V} : G.neighborSet v = โ โ G.IsIsolated v - 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.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.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.neighborSet_subset_compl ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : G.neighborSet v โ {v}แถ - 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.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.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.neighborSet_eq_compl_singleton ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G : SimpleGraph V} {v : V} : G.neighborSet v = {v}แถ โ G.IsUniversal 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.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.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.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.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.compl_neighborSet_disjoint ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) (v : V) : Disjoint (G.neighborSet v) (Gแถ.neighborSet v) - SimpleGraph.incidence_other_neighbor_edge ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] {v w : V} (h : w โ G.neighborSet v) : G.otherVertexOfIncident โฏ = w - SimpleGraph.card_neighborSet_union_compl_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Fintype V] (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v โช Gแถ.neighborSet v)] : (G.neighborSet v โช Gแถ.neighborSet v).toFinset.card = Fintype.card V - 1 - SimpleGraph.disjoint_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} {G H : SimpleGraph V} : (โ (v : V), Disjoint (G.neighborSet v) (H.neighborSet v)) โ Disjoint G H - SimpleGraph.incidenceSetEquivNeighborSet_apply_coe ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] (v : V) (e : โ(G.incidenceSet v)) : โ((G.incidenceSetEquivNeighborSet v) e) = G.otherVertexOfIncident โฏ - SimpleGraph.incidenceSetEquivNeighborSet_symm_apply_coe ๐ Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} (G : SimpleGraph V) [DecidableEq V] (v : V) (w : โ(G.neighborSet v)) : โ((G.incidenceSetEquivNeighborSet v).symm w) = s(v, โw) - SimpleGraph.dartOfNeighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Dart
{V : Type u_1} (G : SimpleGraph V) (v : V) (w : โ(G.neighborSet v)) : G.Dart - SimpleGraph.dartOfNeighborSet_injective ๐ Mathlib.Combinatorics.SimpleGraph.Dart
{V : Type u_1} (G : SimpleGraph V) (v : V) : Function.Injective (G.dartOfNeighborSet v) - SimpleGraph.dartOfNeighborSet_toProd ๐ Mathlib.Combinatorics.SimpleGraph.Dart
{V : Type u_1} (G : SimpleGraph V) (v : V) (w : โ(G.neighborSet v)) : (G.dartOfNeighborSet v w).toProd = (v, โw) - SimpleGraph.neighborSet_comap ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (G' : SimpleGraph W) (f : V โ W) (v : V) : (SimpleGraph.comap f G').neighborSet v = f โปยน' G'.neighborSet (f v) - SimpleGraph.Hom.mapNeighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (v : V) (w : โ(G.neighborSet v)) : โ(G'.neighborSet (f v)) - SimpleGraph.Embedding.mapNeighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โชg G') (v : V) : โ(G.neighborSet v) โช โ(G'.neighborSet (f v)) - SimpleGraph.Iso.mapNeighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (v : V) : โ(G.neighborSet v) โ โ(G'.neighborSet (f v)) - SimpleGraph.neighborSet_induce ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} (G : SimpleGraph V) (s : Set V) (v : โs) : (SimpleGraph.induce s G).neighborSet v = Subtype.val โปยน' G.neighborSet โv - SimpleGraph.neighborSet_map ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (G : SimpleGraph V) (f : V โช W) (v : V) : (SimpleGraph.map (โf) G).neighborSet (f v) = โf '' G.neighborSet v - SimpleGraph.Embedding.preimage_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (v : V) (f : G โชg G') : โf โปยน' G'.neighborSet (f v) = G.neighborSet v - SimpleGraph.Iso.image_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {v : V} (f : G โg G') : โf '' G.neighborSet v = G'.neighborSet (f v) - SimpleGraph.Hom.image_neighborSet_subset ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (v : V) (f : G โg G') : โf '' G.neighborSet v โ G'.neighborSet (f v) - SimpleGraph.Hom.subset_preimage_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (v : V) (f : G โg G') : G.neighborSet v โ โf โปยน' G'.neighborSet (f v) - SimpleGraph.Hom.apply_mem_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') {v w : V} (h : w โ G.neighborSet v) : f w โ G'.neighborSet (f v) - SimpleGraph.Embedding.apply_mem_neighborSet_iff ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โชg G') {v w : V} : f w โ G'.neighborSet (f v) โ w โ G.neighborSet v - SimpleGraph.Iso.apply_mem_neighborSet_iff ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') {v w : V} : f w โ G'.neighborSet (f v) โ w โ G.neighborSet v - SimpleGraph.neighborSet_map_equiv ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (G : SimpleGraph V) (e : V โ W) (w : W) : (SimpleGraph.map (โe) G).neighborSet w = โe.symm โปยน' G.neighborSet (e.symm w) - SimpleGraph.Hom.mapNeighborSet_coe ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (v : V) (w : โ(G.neighborSet v)) : โ(f.mapNeighborSet v w) = f โw - SimpleGraph.Embedding.mapNeighborSet_apply_coe ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โชg G') (v : V) (w : โ(G.neighborSet v)) : โ((f.mapNeighborSet v) w) = f โw - SimpleGraph.Iso.mapNeighborSet_apply_coe ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (v : V) (w : โ(G.neighborSet v)) : โ((f.mapNeighborSet v) w) = f โw - SimpleGraph.Iso.mapNeighborSet_symm_apply_coe ๐ Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G โg G') (v : V) (w : โ(G'.neighborSet (f v))) : โ((f.mapNeighborSet v).symm w) = f.symm โw - SimpleGraph.degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : โ - SimpleGraph.neighborFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : Finset V - SimpleGraph.incidenceFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] : Finset (Sym2 V) - SimpleGraph.neighborSetFintype ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v : V) : Fintype โ(G.neighborSet v) - SimpleGraph.incidenceSetFintype ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] : Fintype โ(G.incidenceSet v) - SimpleGraph.neighborFinset_nonempty ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : (G.neighborFinset v).Nonempty โ ยฌG.IsIsolated v - SimpleGraph.card_neighborFinset_eq_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : (G.neighborFinset v).card = G.degree v - SimpleGraph.degree_eq_zero_of_subsingleton ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} (v : V) [Fintype โ(G.neighborSet v)] [Subsingleton V] : G.degree v = 0 - SimpleGraph.nontrivial_of_degree_ne_zero ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {v : V} [Fintype โ(G.neighborSet v)] (h : G.degree v โ 0) : Nontrivial V - SimpleGraph.card_neighborSet_eq_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : Fintype.card โ(G.neighborSet v) = G.degree v - SimpleGraph.neighborFinset_def ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.neighborFinset v = (G.neighborSet v).toFinset - SimpleGraph.IsIsolated.degree_eq_zero ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.IsIsolated v โ G.degree v = 0 - SimpleGraph.IsIsolated.of_degree_eq_zero ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.degree v = 0 โ G.IsIsolated v - SimpleGraph.degree_eq_zero ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.degree v = 0 โ G.IsIsolated v - SimpleGraph.notMem_neighborFinset_self ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : v โ G.neighborFinset v - SimpleGraph.IsIsolated.neighborFinset_eq_empty ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.IsIsolated v โ G.neighborFinset v = โ - SimpleGraph.IsIsolated.of_neighborFinset_eq_empty ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.neighborFinset v = โ โ G.IsIsolated v - SimpleGraph.card_incidenceFinset_eq_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] : (G.incidenceFinset v).card = G.degree v - SimpleGraph.coe_neighborFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : โ(G.neighborFinset v) = G.neighborSet v - SimpleGraph.neighborFinset_eq_empty ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.neighborFinset v = โ โ G.IsIsolated v - SimpleGraph.degree_pos ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : 0 < G.degree v โ ยฌG.IsIsolated v - SimpleGraph.neighborFinset_disjoint_singleton ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : Disjoint (G.neighborFinset v) {v} - SimpleGraph.singleton_disjoint_neighborFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : Disjoint {v} (G.neighborFinset v) - SimpleGraph.Adj.degree_pos_left ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {v : V} [Fintype โ(G.neighborSet v)] {w : V} (h : G.Adj v w) : 0 < G.degree v - SimpleGraph.Adj.degree_pos_right ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {v : V} [Fintype โ(G.neighborSet v)] {w : V} (h : G.Adj w v) : 0 < G.degree v - SimpleGraph.degree_pos_iff_nonempty ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {v : V} [Fintype โ(G.neighborSet v)] : 0 < G.degree v โ (G.neighborSet v).Nonempty - SimpleGraph.degree_eq_one_iff_existsUnique_adj ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {v : V} [Fintype โ(G.neighborSet v)] : G.degree v = 1 โ โ! w, G.Adj v w - SimpleGraph.degree_le_card_edgeFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [Fintype โG.edgeSet] : G.degree v โค G.edgeFinset.card - SimpleGraph.degree_pos_iff_exists_adj ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : 0 < G.degree v โ โ w, G.Adj v w - SimpleGraph.card_incidenceSet_eq_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] : Fintype.card โ(G.incidenceSet v) = G.degree v - SimpleGraph.mem_neighborFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] (w : V) : w โ G.neighborFinset v โ G.Adj v w - SimpleGraph.degree_eq_zero_iff_notMem_support ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : G.degree v = 0 โ v โ G.support - SimpleGraph.degree_pos_iff_mem_support ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] : 0 < G.degree v โ v โ G.support - SimpleGraph.coe_incidenceFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] : โ(G.incidenceFinset v) = G.incidenceSet v - SimpleGraph.degree_le_of_le ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {v : V} [Fintype โ(G.neighborSet v)] {H : SimpleGraph V} [Fintype โ(H.neighborSet v)] (hle : G โค H) : G.degree v โค H.degree v - SimpleGraph.degree_lt_card_verts ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} [Fintype V] [DecidableRel G.Adj] (v : V) : G.degree v < Fintype.card V - SimpleGraph.degree_le_maxDegree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v : V) : G.degree v โค G.maxDegree - SimpleGraph.minDegree_le_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v : V) : G.minDegree โค G.degree v - SimpleGraph.incidenceFinset_subset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] [Fintype โG.edgeSet] : G.incidenceFinset v โ G.edgeFinset - SimpleGraph.exists_maximal_degree_vertex ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] [Nonempty V] : โ v, G.maxDegree = G.degree v - SimpleGraph.exists_minimal_degree_vertex ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] [Nonempty V] : โ v, G.minDegree = G.degree v - SimpleGraph.IsRegularOfDegree.maxDegree_eq ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [Nonempty V] [DecidableRel G.Adj] {d : โ} (h : G.IsRegularOfDegree d) : G.maxDegree = d - SimpleGraph.IsRegularOfDegree.minDegree_eq ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [Nonempty V] [DecidableRel G.Adj] {d : โ} (h : G.IsRegularOfDegree d) : G.minDegree = d - SimpleGraph.neighborFinset_bot ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (v : V) [Fintype โ(โฅ.neighborSet v)] : โฅ.neighborFinset v = โ - SimpleGraph.maxDegree_le_of_forall_degree_le ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (k : โ) (h : โ (v : V), G.degree v โค k) : G.maxDegree โค k - SimpleGraph.le_minDegree_of_forall_le_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] [Nonempty V] (k : โ) (h : โ (v : V), k โค G.degree v) : k โค G.minDegree - SimpleGraph.mem_incidenceFinset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] (e : Sym2 V) : e โ G.incidenceFinset v โ e โ G.incidenceSet v - SimpleGraph.neighborFinset_eq_filter ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] {v : V} [DecidableRel G.Adj] : G.neighborFinset v = {w | G.Adj v w} - SimpleGraph.neighborFinset_eq_erase_univ ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableEq V] [DecidableRel G.Adj] (v : V) : G.neighborFinset v = Finset.univ.erase v โ G.IsUniversal v - SimpleGraph.complete_graph_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] [DecidableEq V] (v : V) : (SimpleGraph.completeGraph V).degree v = Fintype.card V - 1 - SimpleGraph.insert_neighborFinset_eq_univ ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableEq V] [DecidableRel G.Adj] (v : V) : insert v (G.neighborFinset v) = Finset.univ โ G.IsUniversal v - SimpleGraph.degree_eq_card_sub_one ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v : V) : G.degree v = Fintype.card V - 1 โ G.IsUniversal v - SimpleGraph.incidenceFinset_eq_filter ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] [Fintype โG.edgeSet] : G.incidenceFinset v = {e โ G.edgeFinset | v โ e} - SimpleGraph.degree_lt_card_sub_one ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v : V) : G.degree v < Fintype.card V - 1 โ ยฌG.IsUniversal v - SimpleGraph.disjoint_neighborFinset_of_disjoint ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G H : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [Fintype โ(H.neighborSet v)] (h : Disjoint G H) : Disjoint (G.neighborFinset v) (H.neighborFinset v) - SimpleGraph.degree_compl ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [Fintype โ(Gแถ.neighborSet v)] [Fintype V] : Gแถ.degree v = Fintype.card V - 1 - G.degree v - SimpleGraph.neighborFinset_inf ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (v : V) [DecidableEq V] {Gโ Gโ : SimpleGraph V} [Fintype โ((Gโ โ Gโ).neighborSet v)] [Fintype โ(Gโ.neighborSet v)] [Fintype โ(Gโ.neighborSet v)] : (Gโ โ Gโ).neighborFinset v = Gโ.neighborFinset v โฉ Gโ.neighborFinset v - SimpleGraph.neighborFinset_sdiff ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (v : V) [DecidableEq V] {Gโ Gโ : SimpleGraph V} [Fintype โ((Gโ \ Gโ).neighborSet v)] [Fintype โ(Gโ.neighborSet v)] [Fintype โ(Gโ.neighborSet v)] : (Gโ \ Gโ).neighborFinset v = Gโ.neighborFinset v \ Gโ.neighborFinset v - SimpleGraph.neighborFinset_sup ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (v : V) [DecidableEq V] {Gโ Gโ : SimpleGraph V} [Fintype โ((Gโ โ Gโ).neighborSet v)] [Fintype โ(Gโ.neighborSet v)] [Fintype โ(Gโ.neighborSet v)] : (Gโ โ Gโ).neighborFinset v = Gโ.neighborFinset v โช Gโ.neighborFinset v - SimpleGraph.disjoint_incidenceFinset_of_disjoint ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G H : SimpleGraph V) (v : V) [Fintype โ(G.neighborSet v)] [DecidableEq V] [Fintype โ(H.neighborSet v)] (h : Disjoint G H) : Disjoint (G.incidenceFinset v) (H.incidenceFinset v) - SimpleGraph.card_commonNeighbors_le_degree_left ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v w : V) : Fintype.card โ(G.commonNeighbors v w) โค G.degree v - SimpleGraph.card_commonNeighbors_le_degree_right ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v w : V) : Fintype.card โ(G.commonNeighbors v w) โค G.degree w - SimpleGraph.IsRegularOfDegree.bot ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] : โฅ.IsRegularOfDegree 0 - SimpleGraph.bot_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] (v : V) : โฅ.degree v = 0 - SimpleGraph.Adj.card_commonNeighbors_lt_degree ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {v w : V} (h : G.Adj v w) : Fintype.card โ(G.commonNeighbors v w) < G.degree v - SimpleGraph.Iso.degree_eq ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} (f : G โg G') (x : V) [Fintype โ(G.neighborSet x)] [Fintype โ(G'.neighborSet (f x))] : G'.degree (f x) = G.degree x - SimpleGraph.IsRegularOfDegree.top ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] [DecidableEq V] : โค.IsRegularOfDegree (Fintype.card V - 1) - SimpleGraph.neighborFinset_sup_of_disjoint ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (v : V) {Gโ Gโ : SimpleGraph V} [Fintype โ((Gโ โ Gโ).neighborSet v)] [Fintype โ(Gโ.neighborSet v)] [Fintype โ(Gโ.neighborSet v)] (h : Disjoint Gโ Gโ) : (Gโ โ Gโ).neighborFinset v = (Gโ.neighborFinset v).disjUnion (Gโ.neighborFinset v) โฏ - SimpleGraph.neighborFinset_top ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (v : V) [Fintype V] [DecidableEq V] : โค.neighborFinset v = {v}แถ - SimpleGraph.IsRegularOfDegree.compl ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] [DecidableEq V] {G : SimpleGraph V} [DecidableRel G.Adj] {k : โ} (h : G.IsRegularOfDegree k) : Gแถ.IsRegularOfDegree (Fintype.card V - 1 - k) - SimpleGraph.neighborFinset_compl ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableEq V] [DecidableRel G.Adj] (v : V) : Gแถ.neighborFinset v = (G.neighborFinset v)แถ \ {v} - SimpleGraph.degree_induce_of_support_subset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x โ s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] (h : G.support โ s) (v : โs) : (SimpleGraph.induce s G).degree v = G.degree โv - SimpleGraph.degree_induce_of_neighborSet_subset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x โ s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {v : โs} (h : G.neighborSet โv โ s) : (SimpleGraph.induce s G).degree v = G.degree โv - SimpleGraph.degree_induce_support ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] (v : โG.support) : (SimpleGraph.induce G.support G).degree v = G.degree โv - SimpleGraph.map_neighborFinset_induce_of_neighborSet_subset ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x โ s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {v : โs} (h : G.neighborSet โv โ s) : Finset.map (Function.Embedding.subtype fun x => x โ s) ((SimpleGraph.induce s G).neighborFinset v) = G.neighborFinset โv - SimpleGraph.map_neighborFinset_induce ๐ Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x โ s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] [DecidableEq V] (v : โs) : Finset.map (Function.Embedding.subtype fun x => x โ s) ((SimpleGraph.induce s G).neighborFinset v) = G.neighborFinset โv โฉ s.toFinset - SimpleGraph.dart_card_eq_sum_degrees ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] : Fintype.card G.Dart = โ v, G.degree v - SimpleGraph.sum_degrees_eq_twice_card_edges ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] : โ v, G.degree v = 2 * G.edgeFinset.card - SimpleGraph.exists_ne_odd_degree_of_exists_odd_degree ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] (v : V) (h : Odd (G.degree v)) : โ w, w โ v โง Odd (G.degree w) - SimpleGraph.even_card_odd_degree_vertices ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] : Even {v | Odd (G.degree v)}.card - SimpleGraph.dart_fst_fiber_card_eq_degree ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] [DecidableEq V] (v : V) : {d | d.toProd.1 = v}.card = G.degree v - SimpleGraph.sum_degrees_support_eq_twice_card_edges ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] : โ v โ G.support.toFinset, G.degree v = 2 * G.edgeFinset.card - SimpleGraph.dart_fst_fiber ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] [DecidableEq V] (v : V) : {d | d.toProd.1 = v} = Finset.image (G.dartOfNeighborSet v) Finset.univ - SimpleGraph.odd_card_odd_degree_vertices_ne ๐ Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableEq V] [DecidableRel G.Adj] (v : V) (h : Odd (G.degree v)) : Odd {w | w โ v โง Odd (G.degree w)}.card - SimpleGraph.card_edgeFinset_deleteIncidenceSet ๐ Mathlib.Combinatorics.SimpleGraph.DeleteEdges
{V : Type u_1} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (x : V) : (G.deleteIncidenceSet x).edgeFinset.card = G.edgeFinset.card - G.degree x - SimpleGraph.edgeFinset_deleteIncidenceSet_eq_sdiff ๐ Mathlib.Combinatorics.SimpleGraph.DeleteEdges
{V : Type u_1} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (x : V) : (G.deleteIncidenceSet x).edgeFinset = G.edgeFinset \ G.incidenceFinset x - SimpleGraph.Subgraph.neighborSet_subset ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v : V) : G'.neighborSet v โ G.neighborSet v - SimpleGraph.Subgraph.neighborSet_top ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (v : V) : โค.neighborSet v = G.neighborSet v - SimpleGraph.Subgraph.degree_le ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v : V) [Fintype โ(G'.neighborSet v)] [Fintype โ(G.neighborSet v)] : G'.degree v โค G.degree v - SimpleGraph.Subgraph.neighborSet_eq_of_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) : H.neighborSet v = G.neighborSet v - 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.degree_spanningCoe ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (v : V) [Fintype โ(G'.neighborSet v)] [Fintype โ(G'.spanningCoe.neighborSet v)] : G'.spanningCoe.degree v = G'.degree v - SimpleGraph.Subgraph.neighborSet_iInf ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{ฮน : Sort u_1} {V : Type u} {G : SimpleGraph V} (f : ฮน โ G.Subgraph) (v : V) : (โจ i, f i).neighborSet v = (โ i, (f i).neighborSet v) โฉ G.neighborSet v - SimpleGraph.degree_toSubgraph ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} (G H : SimpleGraph V) (h : H โค G) {v : V} [Fintype โ((SimpleGraph.toSubgraph H h).neighborSet v)] [Fintype โ(H.neighborSet v)] : (SimpleGraph.toSubgraph H h).degree v = H.degree v - SimpleGraph.card_neighborSet_toSubgraph ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} (G H : SimpleGraph V) (h : H โค G) (v : V) [Fintype โ((SimpleGraph.toSubgraph H h).neighborSet v)] [Fintype โ(H.neighborSet v)] : Fintype.card โ((SimpleGraph.toSubgraph H h).neighborSet v) = H.degree v - SimpleGraph.Subgraph.coeNeighborSetEquiv ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (v : โG'.verts) : โ(G'.coe.neighborSet v) โ โ(G'.neighborSet โv) - SimpleGraph.Subgraph.coeFiniteAt ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (v : โG'.verts) [Fintype โ(G'.neighborSet โv)] : Fintype โ(G'.coe.neighborSet v) - 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.neighborSet_sInf ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (s : Set G.Subgraph) (v : V) : (sInf s).neighborSet v = (โ G' โ s, G'.neighborSet v) โฉ G.neighborSet v - SimpleGraph.Subgraph.coe_degree ๐ Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v : โG'.verts) [Fintype โ(G'.coe.neighborSet v)] [Fintype โ(G'.neighborSet โv)] : G'.coe.degree v = G'.degree โv - SimpleGraph.Copy.mapNeighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : H.Copy G) (a : W) : โ(H.neighborSet a) โช โ(G.neighborSet (f a)) - SimpleGraph.Copy.degree_le ๐ Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : G.Copy H) (v : V) [Fintype โ(G.neighborSet v)] [Fintype โ(H.neighborSet (f v))] : G.degree v โค H.degree (f v) - SimpleGraph.edgeSet_replaceVertex_of_not_adj ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] (hn : ยฌG.Adj s t) : (G.replaceVertex s t).edgeSet = G.edgeSet \ G.incidenceSet t โช (fun x => s(x, t)) '' G.neighborSet s - SimpleGraph.edgeSet_replaceVertex_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] (ha : G.Adj s t) : (G.replaceVertex s t).edgeSet = (G.edgeSet \ G.incidenceSet t โช (fun x => s(x, t)) '' G.neighborSet s) \ {s(t, t)} - SimpleGraph.disjoint_sdiff_neighborFinset_image ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] : Disjoint (G.edgeFinset \ G.incidenceFinset t) (Finset.image (fun x => s(x, t)) (G.neighborFinset s)) - SimpleGraph.card_edgeFinset_replaceVertex_of_not_adj ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (hn : ยฌG.Adj s t) : (G.replaceVertex s t).edgeFinset.card = G.edgeFinset.card + G.degree s - G.degree t - SimpleGraph.card_edgeFinset_replaceVertex_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (ha : G.Adj s t) : (G.replaceVertex s t).edgeFinset.card = G.edgeFinset.card + G.degree s - G.degree t - 1 - SimpleGraph.edgeFinset_replaceVertex_of_not_adj ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (hn : ยฌG.Adj s t) : (G.replaceVertex s t).edgeFinset = G.edgeFinset \ G.incidenceFinset t โช Finset.image (fun x => s(x, t)) (G.neighborFinset s) - SimpleGraph.edgeFinset_replaceVertex_of_adj ๐ Mathlib.Combinatorics.SimpleGraph.Operations
{V : Type u_1} (G : SimpleGraph V) {s t : V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] (ha : G.Adj s t) : (G.replaceVertex s t).edgeFinset = (G.edgeFinset \ G.incidenceFinset t โช Finset.image (fun x => s(x, t)) (G.neighborFinset s)) \ {s(t, t)} - SimpleGraph.isIndepSet_neighborSet_of_triangleFree ๐ Mathlib.Combinatorics.SimpleGraph.Clique
{ฮฑ : Type u_1} (G : SimpleGraph ฮฑ) (h : G.CliqueFree 3) (v : ฮฑ) : G.IsIndepSet (G.neighborSet v) - SimpleGraph.CliqueFreeOn.of_succ ๐ Mathlib.Combinatorics.SimpleGraph.Clique
{ฮฑ : Type u_1} (G : SimpleGraph ฮฑ) {s : Set ฮฑ} {a : ฮฑ} {n : โ} (hs : G.CliqueFreeOn s (n + 1)) (ha : a โ s) : G.CliqueFreeOn (s โฉ G.neighborSet a) n - SimpleGraph.Reachable.nonempty_neighborSet_left ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} (huv : u โ v) (hreach : G.Reachable u v) : (G.neighborSet u).Nonempty - SimpleGraph.Reachable.nonempty_neighborSet_right ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} (huv : u โ v) (hreach : G.Reachable u v) : (G.neighborSet v).Nonempty - SimpleGraph.not_reachable_of_neighborSet_left_eq_empty ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} (huv : u โ v) (hu : G.neighborSet u = โ ) : ยฌG.Reachable u v - SimpleGraph.not_reachable_of_neighborSet_right_eq_empty ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} (huv : u โ v) (hv : G.neighborSet v = โ ) : ยฌG.Reachable u v - SimpleGraph.Preconnected.degree_pos_of_nontrivial ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} [Nontrivial V] {G : SimpleGraph V} (h : G.Preconnected) (v : V) [Fintype โ(G.neighborSet v)] : 0 < G.degree v - SimpleGraph.Preconnected.induce_of_degree_eq_one ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} (hG : G.Preconnected) {s : Set V} (hs : โ v โ s, (G.neighborSet v).Subsingleton) : (SimpleGraph.induce s G).Preconnected - SimpleGraph.not_reachable_of_left_degree_zero ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} [Fintype โ(G.neighborSet u)] (huv : u โ v) (hu : G.degree u = 0) : ยฌG.Reachable u v - SimpleGraph.not_reachable_of_right_degree_zero ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} [Fintype โ(G.neighborSet v)] (huv : u โ v) (hu : G.degree v = 0) : ยฌG.Reachable u v - SimpleGraph.Reachable.degree_pos_left ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} [Fintype โ(G.neighborSet u)] (huv : u โ v) (hreach : G.Reachable u v) : 0 < G.degree u - SimpleGraph.Reachable.degree_pos_right ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v : V} [Fintype โ(G.neighborSet v)] (huv : u โ v) (hreach : G.Reachable u v) : 0 < G.degree v - SimpleGraph.Walk.IsTrail.not_mem_support_of_subsingleton_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {G : SimpleGraph V} {u v x : V} {w : G.Walk u v} (hw : w.IsTrail) (hxu : x โ u) (hxv : x โ v) (hx : (G.neighborSet x).Subsingleton) : x โ w.support - SimpleGraph.isBipartiteWith_neighborSet_subset ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Set V} (h : G.IsBipartiteWith s t) (hv : v โ s) : G.neighborSet v โ t - SimpleGraph.isBipartiteWith_neighborSet_subset' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Set V} (h : G.IsBipartiteWith s t) (hw : w โ t) : G.neighborSet w โ s - SimpleGraph.neighborSet_subset_between_union ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s : Set V} (hv : v โ s) : G.neighborSet v โ (SimpleGraph.between s sแถ G).neighborSet v โช s - SimpleGraph.isBipartiteWith_neighborSet ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Set V} (h : G.IsBipartiteWith s t) (hv : v โ s) : G.neighborSet v = {w | w โ t โง G.Adj v w} - SimpleGraph.isBipartiteWith_neighborSet' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Set V} (h : G.IsBipartiteWith s t) (hw : w โ t) : G.neighborSet w = {v | v โ s โง G.Adj v w} - SimpleGraph.neighborSet_subset_between_union_compl ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s : Set V} (hw : w โ sแถ) : G.neighborSet w โ (SimpleGraph.between s sแถ G).neighborSet w โช sแถ - SimpleGraph.isBipartiteWith_degree_le ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet v)] (h : G.IsBipartiteWith โs โt) (hv : v โ s) : G.degree v โค t.card - SimpleGraph.isBipartiteWith_degree_le' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet w)] (h : G.IsBipartiteWith โs โt) (hw : w โ t) : G.degree w โค s.card - SimpleGraph.isBipartiteWith_neighborFinset_disjoint ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet v)] (h : G.IsBipartiteWith โs โt) (hv : v โ s) : Disjoint (G.neighborFinset v) s - SimpleGraph.isBipartiteWith_neighborFinset_disjoint' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet w)] (h : G.IsBipartiteWith โs โt) (hw : w โ t) : Disjoint (G.neighborFinset w) t - SimpleGraph.isBipartiteWith_neighborSet_disjoint ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Set V} (h : G.IsBipartiteWith s t) (hv : v โ s) : Disjoint (G.neighborSet v) s - SimpleGraph.isBipartiteWith_neighborSet_disjoint' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Set V} (h : G.IsBipartiteWith s t) (hw : w โ t) : Disjoint (G.neighborSet w) t - SimpleGraph.isBipartiteWith_neighborFinset_subset ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet v)] (h : G.IsBipartiteWith โs โt) (hv : v โ s) : G.neighborFinset v โ t - SimpleGraph.isBipartiteWith_neighborFinset_subset' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet w)] (h : G.IsBipartiteWith โs โt) (hw : w โ t) : G.neighborFinset w โ s - SimpleGraph.isBipartiteWith_bipartiteAbove ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet v)] [DecidableRel G.Adj] (h : G.IsBipartiteWith โs โt) (hv : v โ s) : G.neighborFinset v = Finset.bipartiteAbove G.Adj t v - SimpleGraph.isBipartiteWith_neighborFinset ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {v : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet v)] [DecidableRel G.Adj] (h : G.IsBipartiteWith โs โt) (hv : v โ s) : G.neighborFinset v = {w โ t | G.Adj v w} - SimpleGraph.isBipartiteWith_bipartiteBelow ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet w)] [DecidableRel G.Adj] (h : G.IsBipartiteWith โs โt) (hw : w โ t) : G.neighborFinset w = Finset.bipartiteBelow G.Adj s w - SimpleGraph.isBipartiteWith_neighborFinset' ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} {s t : Finset V} [Fintype โ(G.neighborSet w)] [DecidableRel G.Adj] (h : G.IsBipartiteWith โs โt) (hw : w โ t) : G.neighborFinset w = {v โ s | G.Adj v w} - SimpleGraph.isBipartiteWith_sum_degrees_eq_card_edges ๐ Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {G : SimpleGraph V} {s t : Finset V} [Fintype V] [DecidableRel G.Adj] (h : G.IsBipartiteWith โs โt) : โ v โ s, G.degree v = G.edgeFinset.card
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