Home Metamath Proof ExplorerTheorem List (p. 406 of 424) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-27159) Hilbert Space Explorer (27160-28684) Users' Mathboxes (28685-42360)

Theorem List for Metamath Proof Explorer - 40501-40600   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremegrsubgr 40501 An empty graph consisting of a subset of vertices of a graph (and having no edges) is a subgraph of the graph. (Contributed by AV, 17-Nov-2020.) (Proof shortened by AV, 17-Dec-2020.)
(((𝐺𝑊𝑆𝑈) ∧ (Vtx‘𝑆) ⊆ (Vtx‘𝐺) ∧ (Fun (iEdg‘𝑆) ∧ (Edg‘𝑆) = ∅)) → 𝑆 SubGraph 𝐺)

Theorem0grsubgr 40502 The null graph (represented by an empty set) is a subgraph of all graphs. (Contributed by AV, 17-Nov-2020.)
(𝐺𝑊 → ∅ SubGraph 𝐺)

Theorem0uhgrsubgr 40503 The null graph (as hypergraph) is a subgraph of all graphs. (Contributed by AV, 17-Nov-2020.) (Proof shortened by AV, 28-Nov-2020.)
((𝐺𝑊𝑆 ∈ UHGraph ∧ (Vtx‘𝑆) = ∅) → 𝑆 SubGraph 𝐺)

Theoremuhgrsubgrself 40504 A hypergraph is a subgraph of itself. (Contributed by AV, 17-Nov-2020.) (Proof shortened by AV, 21-Nov-2020.)
(𝐺 ∈ UHGraph → 𝐺 SubGraph 𝐺)

Theoremsubgrfun 40505 The edge function of a subgraph of a graph whose edge function is actually a function is a function. (Contributed by AV, 20-Nov-2020.)
((Fun (iEdg‘𝐺) ∧ 𝑆 SubGraph 𝐺) → Fun (iEdg‘𝑆))

Theoremsubgruhgrfun 40506 The edge function of a subgraph of a hypergraph is a function. (Contributed by AV, 16-Nov-2020.) (Proof shortened by AV, 20-Nov-2020.)
((𝐺 ∈ UHGraph ∧ 𝑆 SubGraph 𝐺) → Fun (iEdg‘𝑆))

Theoremsubgreldmiedg 40507 An element of the domain of the edge function of a subgraph is an element of the domain of the edge function of the supergraph. (Contributed by AV, 20-Nov-2020.)
((𝑆 SubGraph 𝐺𝑋 ∈ dom (iEdg‘𝑆)) → 𝑋 ∈ dom (iEdg‘𝐺))

Theoremsubgruhgredgd 40508 An edge of a subgraph of a hypergraph is a nonempty subset of its vertices. (Contributed by AV, 17-Nov-2020.) (Revised by AV, 21-Nov-2020.)
𝑉 = (Vtx‘𝑆)    &   𝐼 = (iEdg‘𝑆)    &   (𝜑𝐺 ∈ UHGraph )    &   (𝜑𝑆 SubGraph 𝐺)    &   (𝜑𝑋 ∈ dom 𝐼)       (𝜑 → (𝐼𝑋) ∈ (𝒫 𝑉 ∖ {∅}))

Theoremsubumgredg2 40509* An edge of a subgraph of a multigraph connects exactly two different vertices. (Contributed by AV, 26-Nov-2020.)
𝑉 = (Vtx‘𝑆)    &   𝐼 = (iEdg‘𝑆)       ((𝑆 SubGraph 𝐺𝐺 ∈ UMGraph ∧ 𝑋 ∈ dom 𝐼) → (𝐼𝑋) ∈ {𝑒 ∈ 𝒫 𝑉 ∣ (#‘𝑒) = 2})

Theoremsubuhgr 40510 A subgraph of a hypergraph is a hypergraph. (Contributed by AV, 16-Nov-2020.) (Proof shortened by AV, 21-Nov-2020.)
((𝐺 ∈ UHGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UHGraph )

Theoremsubupgr 40511 A subgraph of a pseudograph is a pseudograph. (Contributed by AV, 16-Nov-2020.) (Proof shortened by AV, 21-Nov-2020.)
((𝐺 ∈ UPGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UPGraph )

Theoremsubumgr 40512 A subgraph of a multigraph is a multigraph. (Contributed by AV, 26-Nov-2020.)
((𝐺 ∈ UMGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UMGraph )

Theoremsubusgr 40513 A subgraph of a simple graph is a simple graph. (Contributed by AV, 16-Nov-2020.) (Proof shortened by AV, 27-Nov-2020.)
((𝐺 ∈ USGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ USGraph )

Theoremuhgrspansubgrlem 40514 Lemma for uhgrspansubgr 40515: The edges of the graph 𝑆 obtained by removing some edges of a hypergraph 𝐺 are subsets of its vertices (a spanning subgraph, see comment for uhgrspansubgr 40515. (Contributed by AV, 18-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)    &   (𝜑𝑆𝑊)    &   (𝜑 → (Vtx‘𝑆) = 𝑉)    &   (𝜑 → (iEdg‘𝑆) = (𝐸𝐴))    &   (𝜑𝐺 ∈ UHGraph )       (𝜑 → (Edg‘𝑆) ⊆ 𝒫 (Vtx‘𝑆))

Theoremuhgrspansubgr 40515 A spanning subgraph 𝑆 of a hypergraph 𝐺 is actually a subgraph of 𝐺. A subgraph 𝑆 of a graph 𝐺 which has the same vertices as 𝐺 and is obtained by removing some edges of 𝐺 is called a spanning subgraph (see section I.1 in [Bollobas] p. 2 and section 1.1 in [Diestel] p. 4). Formally, the edges are "removed" by restricting the edge function of the original graph by an arbitrary class (which actually needs not to be a subset of the domain of the edge function). (Contributed by AV, 18-Nov-2020.) (Proof shortened by AV, 21-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)    &   (𝜑𝑆𝑊)    &   (𝜑 → (Vtx‘𝑆) = 𝑉)    &   (𝜑 → (iEdg‘𝑆) = (𝐸𝐴))    &   (𝜑𝐺 ∈ UHGraph )       (𝜑𝑆 SubGraph 𝐺)

Theoremuhgrspan 40516 A spanning subgraph 𝑆 of a hypergraph 𝐺 is a hypergraph. (Contributed by AV, 11-Oct-2020.) (Proof shortened by AV, 18-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)    &   (𝜑𝑆𝑊)    &   (𝜑 → (Vtx‘𝑆) = 𝑉)    &   (𝜑 → (iEdg‘𝑆) = (𝐸𝐴))    &   (𝜑𝐺 ∈ UHGraph )       (𝜑𝑆 ∈ UHGraph )

Theoremupgrspan 40517 A spanning subgraph 𝑆 of a pseudograph 𝐺 is a pseudograph. (Contributed by AV, 11-Oct-2020.) (Proof shortened by AV, 18-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)    &   (𝜑𝑆𝑊)    &   (𝜑 → (Vtx‘𝑆) = 𝑉)    &   (𝜑 → (iEdg‘𝑆) = (𝐸𝐴))    &   (𝜑𝐺 ∈ UPGraph )       (𝜑𝑆 ∈ UPGraph )

Theoremumgrspan 40518 A spanning subgraph 𝑆 of a multigraph 𝐺 is a multigraph. (Contributed by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)    &   (𝜑𝑆𝑊)    &   (𝜑 → (Vtx‘𝑆) = 𝑉)    &   (𝜑 → (iEdg‘𝑆) = (𝐸𝐴))    &   (𝜑𝐺 ∈ UMGraph )       (𝜑𝑆 ∈ UMGraph )

Theoremusgrspan 40519 A spanning subgraph 𝑆 of a simple graph 𝐺 is a simple graph. (Contributed by AV, 15-Oct-2020.) (Revised by AV, 16-Oct-2020.) (Proof shortened by AV, 18-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)    &   (𝜑𝑆𝑊)    &   (𝜑 → (Vtx‘𝑆) = 𝑉)    &   (𝜑 → (iEdg‘𝑆) = (𝐸𝐴))    &   (𝜑𝐺 ∈ USGraph )       (𝜑𝑆 ∈ USGraph )

Theoremuhgrspanop 40520 A spanning subgraph of a hypergraph represented by an ordered pair is a hypergraph. (Contributed by Alexander van der Vekens, 27-Dec-2017.) (Revised by AV, 11-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)       (𝐺 ∈ UHGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ UHGraph )

Theoremupgrspanop 40521 A spanning subgraph of a pseudograph represented by an ordered pair is a pseudograph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 13-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)       (𝐺 ∈ UPGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ UPGraph )

Theoremumgrspanop 40522 A spanning subgraph of a multigraph represented by an ordered pair is a multigraph. (Contributed by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)       (𝐺 ∈ UMGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ UMGraph )

Theoremusgrspanop 40523 A spanning subgraph of a simple graph represented by an ordered pair is a simple graph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (iEdg‘𝐺)       (𝐺 ∈ USGraph → ⟨𝑉, (𝐸𝐴)⟩ ∈ USGraph )

Theoremuhgrspan1lem1 40524 Lemma 1 for uhgrspan1 40527. (Contributed by AV, 19-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   𝐹 = {𝑖 ∈ dom 𝐼𝑁 ∉ (𝐼𝑖)}       ((𝑉 ∖ {𝑁}) ∈ V ∧ (𝐼𝐹) ∈ V)

Theoremuhgrspan1lem2 40525 Lemma 2 for uhgrspan1 40527. (Contributed by AV, 19-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   𝐹 = {𝑖 ∈ dom 𝐼𝑁 ∉ (𝐼𝑖)}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), (𝐼𝐹)⟩       (Vtx‘𝑆) = (𝑉 ∖ {𝑁})

Theoremuhgrspan1lem3 40526 Lemma 3 for uhgrspan1 40527. (Contributed by AV, 19-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   𝐹 = {𝑖 ∈ dom 𝐼𝑁 ∉ (𝐼𝑖)}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), (𝐼𝐹)⟩       (iEdg‘𝑆) = (𝐼𝐹)

Theoremuhgrspan1 40527* The induced subgraph 𝑆 of a hypergraph 𝐺 obtained by removing one vertex is actually a subgraph of 𝐺. A subgraph is called induced or spanned by a subset of vertices of a graph if it contains all edges of the original graph that join two vertices of the subgraph (see section I.1 in [Bollobas] p. 2 and section 1.1 in [Diestel] p. 4). (Contributed by AV, 19-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)    &   𝐹 = {𝑖 ∈ dom 𝐼𝑁 ∉ (𝐼𝑖)}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), (𝐼𝐹)⟩       ((𝐺 ∈ UHGraph ∧ 𝑁𝑉) → 𝑆 SubGraph 𝐺)

Theoremupgrres1lem1 40528* Lemma 1 for upgrres1 40532. (Contributed by AV, 7-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}       ((𝑉 ∖ {𝑁}) ∈ V ∧ ( I ↾ 𝐹) ∈ V)

Theoremumgrres1lem 40529* Lemma for umgrres1 40533. (Contributed by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}       ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → ran ( I ↾ 𝐹) ⊆ {𝑝 ∈ 𝒫 (𝑉 ∖ {𝑁}) ∣ (#‘𝑝) = 2})

Theoremupgrres1lem2 40530* Lemma 2 for upgrres1 40532. (Contributed by AV, 7-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩       (Vtx‘𝑆) = (𝑉 ∖ {𝑁})

Theoremupgrres1lem3 40531* Lemma 3 for upgrres1 40532. (Contributed by AV, 7-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩       (iEdg‘𝑆) = ( I ↾ 𝐹)

Theoremupgrres1 40532* A pseudograph obtained by removing one vertex and all edges incident with this vertex is a pseudograph. Remark: This graph is not a subgraph of the original graph in the sense of df-subgr 40492 since the domains of the edge functions may not be compatible. (Contributed by AV, 8-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩       ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → 𝑆 ∈ UPGraph )

Theoremumgrres1 40533* A multigraph obtained by removing one vertex and all edges incident with this vertex is a multigraph. Remark: This graph is not a subgraph of the original graph in the sense of df-subgr 40492 since the domains of the edge functions may not be compatible. (Contributed by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩       ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → 𝑆 ∈ UMGraph )

Theoremusgrres1 40534* Restricting a simple graph by removing one vertex results in a simple graph. Remark: This restricted graph is not a subgraph of the original graph in the sense of df-subgr 40492 since the domains of the edge functions may not be compatible. (Contributed by Alexander van der Vekens, 2-Jan-2018.) (Revised by AV, 10-Jan-2020.) (Revised by AV, 23-Oct-2020.) (Proof shortened by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩       ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → 𝑆 ∈ USGraph )

21.34.8.5  Undirected simple graphs - finite graphs

Syntaxcfusgr 40535 Extend class notation with finite simple graphs.
class FinUSGraph

Definitiondf-fusgr 40536 Define the class of all finite undirected simple graphs without loops (called "finite simple graphs" in the following). A finite graph is an undirected simple graph of finite order, i.e. with a finite set of vertices. (Contributed by AV, 3-Jan-2020.) (Revised by AV, 21-Oct-2020.)
FinUSGraph = {𝑔 ∈ USGraph ∣ (Vtx‘𝑔) ∈ Fin}

Theoremisfusgr 40537 The property of being a finite simple graph. (Contributed by AV, 3-Jan-2020.) (Revised by AV, 21-Oct-2020.)
𝑉 = (Vtx‘𝐺)       (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin))

Theoremfusgrvtxfi 40538 A finite simple graph has a finite set of vertices. (Contributed by AV, 16-Dec-2020.)
𝑉 = (Vtx‘𝐺)       (𝐺 ∈ FinUSGraph → 𝑉 ∈ Fin)

Theoremisfusgrf1 40539* The property of being a finite simple graph. (Contributed by AV, 3-Jan-2020.) (Revised by AV, 21-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)       (𝐺𝑊 → (𝐺 ∈ FinUSGraph ↔ (𝐼:dom 𝐼1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ∧ 𝑉 ∈ Fin)))

Theoremisfusgrcl 40540 The property of being a finite simple graph. (Contributed by AV, 3-Jan-2020.) (Revised by AV, 9-Jan-2020.)
(𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ (#‘(Vtx‘𝐺)) ∈ ℕ0))

Theoremfusgrusgr 40541 A finite simple graph is a simple graph. (Contributed by AV, 16-Jan-2020.) (Revised by AV, 21-Oct-2020.)
(𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph )

Theoremopfusgr 40542 A finite simple graph represented as ordered pair. (Contributed by AV, 23-Oct-2020.)
((𝑉𝑋𝐸𝑌) → (⟨𝑉, 𝐸⟩ ∈ FinUSGraph ↔ (⟨𝑉, 𝐸⟩ ∈ USGraph ∧ 𝑉 ∈ Fin)))

Theoremusgredgffibi 40543 The number of edges in a simple graph is finite iff its edge function is finite. (Contributed by AV, 10-Jan-2020.) (Revised by AV, 22-Oct-2020.)
𝐼 = (iEdg‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝐺 ∈ USGraph → (𝐸 ∈ Fin ↔ 𝐼 ∈ Fin))

Theoremfusgredgfi 40544* In a finite simple graph the number of edges which contain a given vertex is also finite. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 21-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ FinUSGraph ∧ 𝑁𝑉) → {𝑒𝐸𝑁𝑒} ∈ Fin)

Theoremusgr1v0e 40545 The size of a (finite) simple graph with 1 vertex is 0. (Contributed by Alexander van der Vekens, 5-Jan-2018.) (Revised by AV, 22-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ USGraph ∧ (#‘𝑉) = 1) → (#‘𝐸) = 0)

Theoremusgrfilem 40546* In a finite simple graph, the number of edges is finite iff the number of edges not containing one of the vertices is finite. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 9-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}       ((𝐺 ∈ FinUSGraph ∧ 𝑁𝑉) → (𝐸 ∈ Fin ↔ 𝐹 ∈ Fin))

Theoremfusgrfisbase 40547 Induction base for fusgrfis 40549. Main work is done in uhgr0v0e 40464. (Contributed by Alexander van der Vekens, 5-Jan-2018.) (Revised by AV, 23-Oct-2020.)
(((𝑉𝑋𝐸𝑌) ∧ ⟨𝑉, 𝐸⟩ ∈ USGraph ∧ (#‘𝑉) = 0) → 𝐸 ∈ Fin)

Theoremfusgrfisstep 40548* Induction step in fusgrfis 40549: In a finite simple graph, the number of edges is finite if the number of edges not containing one of the vertices is finite. (Contributed by Alexander van der Vekens, 5-Jan-2018.) (Revised by AV, 23-Oct-2020.)
(((𝑉𝑋𝐸𝑌) ∧ ⟨𝑉, 𝐸⟩ ∈ FinUSGraph ∧ 𝑁𝑉) → (( I ↾ {𝑝 ∈ (Edg‘⟨𝑉, 𝐸⟩) ∣ 𝑁𝑝}) ∈ Fin → 𝐸 ∈ Fin))

Theoremfusgrfis 40549 A finite simple graph is of finite size, i.e. has a finite number of edges. (Contributed by Alexander van der Vekens, 6-Jan-2018.) (Revised by AV, 8-Nov-2020.)
(𝐺 ∈ FinUSGraph → (Edg‘𝐺) ∈ Fin)

21.34.8.6  Neighbors, complete graphs and universal vertices

Syntaxcnbgr 40550 Extend class notation with neighbors (of a vertex in a graph).
class NeighbVtx

Syntaxcuvtxa 40551 Extend class notation with the universal vertices (in a graph).
class UnivVtx

Syntaxccplgr 40552 Extend class notation with (arbitrary) complete graphs.
class ComplGraph

Syntaxccusgr 40553 Extend class notation with complete simple graphs.
class ComplUSGraph

Definitiondf-nbgr 40554* Define the (open) neighborhood resp. the class of all neighbors of a vertex (in a graph), see definition in section I.1 of [Bollobas] p. 3 or definition in section 1.1 of [Diestel] p. 3. The neighborhood/neighbors of a vertex are all (other) vertices which are connected with this vertex by an edge. In contrast to a closed neighborhood, a vertex is not a neighbor of itself. This definition is applicable even for arbitrary hypergraphs.

Remark: To distinguish this definition from other definitions for neighborhoods resp. neighbors (e.g., nei in Topology, see df-nei 20712), the suffix Vtx is added to the class constant NeighbVtx. (Contributed by Alexander van der Vekens and Mario Carneiro, 7-Oct-2017.) (Revised by AV, 24-Oct-2020.)

NeighbVtx = (𝑔 ∈ V, 𝑣 ∈ (Vtx‘𝑔) ↦ {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑣, 𝑛} ⊆ 𝑒})

Theoremnbgrprc0 40555 The set of neighbors is empty if the graph or the vertex are proper classes. (Contributed by AV, 26-Oct-2020.)
(¬ (𝐺 ∈ V ∧ 𝑁 ∈ V) → (𝐺 NeighbVtx 𝑁) = ∅)

Definitiondf-uvtxa 40556* Define the class of all universal vertices (in graphs). A vertex is called universal if it is adjacent, i.e. connected by an edge, to all other vertices (of the graph) resp. all other vertices are its neighbors. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 24-Oct-2020.)
UnivVtx = (𝑔 ∈ V ↦ {𝑣 ∈ (Vtx‘𝑔) ∣ ∀𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑣})𝑛 ∈ (𝑔 NeighbVtx 𝑣)})

Definitiondf-cplgr 40557* Define the class of all complete "graphs". A class/graph is called complete if every pair of distinct vertices is connected by an edge, i.e. each vertex has all other vertices as neighbors. (Contributed by AV, 24-Oct-2020.)
ComplGraph = {𝑔 ∣ ∀𝑣 ∈ (Vtx‘𝑔)𝑣 ∈ (UnivVtx‘𝑔)}

Definitiondf-cusgr 40558 Define the class of all complete simple graphs. A simple graph is called complete if every pair of distinct vertices is connected by a (unique) edge, see definition in section 1.1 of [Diestel] p. 3. In contrast, the definition in section I.1 of [Bollobas] p. 3 is based on the size of (finite) complete graphs, see cusgrsize 40670. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 24-Oct-2020.)
ComplUSGraph = {𝑔 ∈ USGraph ∣ 𝑔 ∈ ComplGraph}

Theoremnbgrcl 40559 If a class has at least one neighbor, it must be a vertex. (Contributed by AV, 6-Jun-2021.)
(𝑁 ∈ (𝐺 NeighbVtx 𝑋) → 𝑋 ∈ (Vtx‘𝐺))

Theoremnbgrval 40560* The set of neighbors of a vertex 𝑉 in a graph 𝐺. (Contributed by Alexander van der Vekens, 7-Oct-2017.) (Revised by AV, 24-Oct-2020.) (Revised by AV, 21-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒})

Theoremdfnbgr2 40561* Alternate definition of the neighbors of a vertex breaking up the subset relationship of an unordered pair. (Contributed by AV, 15-Nov-2020.) (Revised by AV, 21-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)})

Theoremdfnbgr3 40562* Alternate definition of the neighbors of a vertex using the edge function instead of the edges themselves [see also nbgraop1 25954]. (Contributed by Alexander van der Vekens, 17-Dec-2017.) (Revised by AV, 25-Oct-2020.) (Revised by AV, 21-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐼 = (iEdg‘𝐺)       ((𝑁𝑉 ∧ Fun 𝐼) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑖 ∈ dom 𝐼{𝑁, 𝑛} ⊆ (𝐼𝑖)})

Theoremnbgrnvtx0 40563 There are no neighbors of a class which is not a vertex. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.)
𝑉 = (Vtx‘𝐺)       (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = ∅)

Theoremnbgrel 40564* Characterization of a neighbor of a vertex 𝑉 in a graph 𝐺. (Contributed by Alexander van der Vekens and Mario Carneiro, 9-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Proof shortened by AV, 6-Jun-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝐺𝑊 → (𝐾 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝐾𝑉𝑁𝑉) ∧ 𝐾𝑁 ∧ ∃𝑒𝐸 {𝑁, 𝐾} ⊆ 𝑒)))

Theoremnbuhgr 40565* The set of neighbors of a vertex in a hypergraph. This version of nbgrval 40560 (with 𝑁 being an arbitrary set instead of being a vertex) only holds for classes whose edges are subsets of the set of vertices (hypergraphs!). (Contributed by AV, 26-Oct-2020.) (Proof shortened by AV, 15-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ UHGraph ∧ 𝑁𝑋) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒})

Theoremnbupgr 40566* The set of neighbors of a vertex in a pseudograph. (Contributed by AV, 5-Nov-2020.) (Proof shortened by AV, 30-Dec-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ {𝑁, 𝑛} ∈ 𝐸})

Theoremnbupgrel 40567 A neighbor of a vertex in a pseudograph. (Contributed by AV, 5-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (((𝐺 ∈ UPGraph ∧ 𝐾𝑉) ∧ (𝑁𝑉𝑁𝐾)) → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸))

Theoremnbumgrvtx 40568* The set of neighbors of a vertex in a multigraph. (Contributed by AV, 27-Nov-2020.) (Proof shortened by AV, 30-Dec-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → (𝐺 NeighbVtx 𝑁) = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})

Theoremnbumgr 40569* The set of neighbors of an arbitrary class in a multigraph. (Contributed by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝐺 ∈ UMGraph → (𝐺 NeighbVtx 𝑁) = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})

Theoremnbusgrvtx 40570* The set of neighbors of a vertex in a simple graph. (Contributed by Alexander van der Vekens, 9-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Proof shortened by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ USGraph ∧ 𝑁𝑉) → (𝐺 NeighbVtx 𝑁) = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})

Theoremnbusgr 40571* The set of neighbors of an arbitrary class in a simple graph. (Contributed by Alexander van der Vekens, 9-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Proof shortened by AV, 27-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝑁) = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})

Theoremnbgr2vtx1edg 40572* If a graph has two vertices, and there is an edge between the vertices, then each vertex is the neighbor of the other vertex. (Contributed by AV, 2-Nov-2020.) (Revised by AV, 25-Mar-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       (((#‘𝑉) = 2 ∧ 𝑉𝐸) → ∀𝑣𝑉𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣))

Theoremnbuhgr2vtx1edgblem 40573* Lemma for nbuhgr2vtx1edgb 40574. This reverse direction of nbgr2vtx1edg 40572 only holds for classes whose edges are subsets of the set of vertices (hypergraphs!) (Contributed by AV, 2-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ UHGraph ∧ 𝑉 = {𝑎, 𝑏} ∧ 𝑎 ∈ (𝐺 NeighbVtx 𝑏)) → {𝑎, 𝑏} ∈ 𝐸)

Theoremnbuhgr2vtx1edgb 40574* If a hypergraph has two vertices, and there is an edge between the vertices, then each vertex is the neighbor of the other vertex. (Contributed by AV, 2-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ UHGraph ∧ (#‘𝑉) = 2) → (𝑉𝐸 ↔ ∀𝑣𝑉𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (𝐺 NeighbVtx 𝑣)))

Theoremnbusgreledg 40575 A class/vertex is a neighbor of another class/vertex in a simple graph iff the vertices are endpoints of an edge. (Contributed by Alexander van der Vekens, 11-Oct-2017.) (Revised by AV, 26-Oct-2020.)
𝐸 = (Edg‘𝐺)       (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸))

Theoremuhgrnbgr0nb 40576* A vertex which is not endpoint of an edge has no neighbor in a hypergraph. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.)
((𝐺 ∈ UHGraph ∧ ∀𝑒 ∈ (Edg‘𝐺)𝑁𝑒) → (𝐺 NeighbVtx 𝑁) = ∅)

Theoremnbgr0vtxlem 40577* Lemma for nbgr0vtx 40578 and nbgr0edg 40579. (Contributed by AV, 15-Nov-2020.)
(𝜑 → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)       (𝜑 → (𝐺 NeighbVtx 𝐾) = ∅)

Theoremnbgr0vtx 40578 In a null graph (with no vertices), all neighborhoods are empty. (Contributed by AV, 15-Nov-2020.)
((Vtx‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)

Theoremnbgr0edg 40579 In an empty graph (with no edges), every vertex has no neighbor. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Proof shortened by AV, 15-Nov-2020.)
((Edg‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)

Theoremnbgr1vtx 40580 In a graph with one vertex, all neighborhoods are empty. (Contributed by AV, 15-Nov-2020.)
((#‘(Vtx‘𝐺)) = 1 → (𝐺 NeighbVtx 𝐾) = ∅)

Theoremnbgrisvtx 40581 Every neighbor of a class/vertex is a vertex. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.)
𝑉 = (Vtx‘𝐺)       ((𝐺𝑊𝑁 ∈ (𝐺 NeighbVtx 𝐾)) → 𝑁𝑉)

Theoremnbgrssvtx 40582 The neighbors of a vertex in a graph are a subset of all vertices of the graph. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.)
𝑉 = (Vtx‘𝐺)       (𝐺𝑊 → (𝐺 NeighbVtx 𝑁) ⊆ 𝑉)

Theoremnbgrnself 40583* A vertex in a graph is not a neighbor of itself. (Contributed by by AV, 3-Nov-2020.) (Revised by AV, 21-Mar-2021.)
𝑉 = (Vtx‘𝐺)       𝑣𝑉 𝑣 ∉ (𝐺 NeighbVtx 𝑣)

Theoremusgrnbnself 40584* A vertex in a simple graph is not a neighbor of itself. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 27-Oct-2020.) (Proof shortened by AV, 3-Nov-2020.)
𝑉 = (Vtx‘𝐺)       (𝐺 ∈ USGraph → ∀𝑣𝑉 𝑣 ∉ (𝐺 NeighbVtx 𝑣))

Theoremnbgrnself2 40585 A class is not a neighbor of itself (whether it is a vertex or not). (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 3-Nov-2020.)
(𝐺𝑊𝑁 ∉ (𝐺 NeighbVtx 𝑁))

Theoremnbgrssovtx 40586 The neighbors of a vertex are a subset of all vertices except the vertex itself. Stronger version of nbgrssvtx 40582. (Contributed by Alexander van der Vekens, 13-Jul-2018.) (Revised by AV, 3-Nov-2020.)
𝑉 = (Vtx‘𝐺)       (𝐺𝑊 → (𝐺 NeighbVtx 𝑁) ⊆ (𝑉 ∖ {𝑁}))

Theoremnbgrssvwo2 40587 The neighbors of a vertex are a subset of all vertices except the vertex itself and a vertex which is not a neighbor. (Contributed by Alexander van der Vekens, 13-Jul-2018.) (Revised by AV, 3-Nov-2020.)
𝑉 = (Vtx‘𝐺)       ((𝐺𝑊𝑀 ∉ (𝐺 NeighbVtx 𝑁)) → (𝐺 NeighbVtx 𝑁) ⊆ (𝑉 ∖ {𝑀, 𝑁}))

Theoremusgrnbnself2 40588 In a simple graph, a class is not a neighbor of itself (whether it is a vertex or not). (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 27-Oct-2020.) (Proof shortened by AV, 3-Nov-2020.)
(𝐺 ∈ USGraph → 𝑁 ∉ (𝐺 NeighbVtx 𝑁))

Theoremusgrnbssovtx 40589 The neighbors of a vertex in a simple graph are a subset of all vertices of the graph except the vertex itself. (Contributed by Alexander van der Vekens, 13-Jul-2018.) (Revised by AV, 27-Oct-2020.) (Proof shortened by AV, 3-Nov-2020.)
𝑉 = (Vtx‘𝐺)       (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝑁) ⊆ (𝑉 ∖ {𝑁}))

Theoremusgrnbssvwo2 40590 The neighbors of a vertex in a simple graph are a subset of all vertices of the graph except the vertex itself and a vertex which is not a neighbor. (Contributed by Alexander van der Vekens, 13-Jul-2018.) (Revised by AV, 27-Oct-2020.)
𝑉 = (Vtx‘𝐺)       ((𝐺 ∈ USGraph ∧ 𝑀 ∉ (𝐺 NeighbVtx 𝑁)) → (𝐺 NeighbVtx 𝑁) ⊆ (𝑉 ∖ {𝑀, 𝑁}))

Theoremnbgrsym 40591 A vertex in a graph is a neighbor of a second vertex iff the second vertex is a neighbor of the first vertex. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 27-Oct-2020.)
(𝐺𝑊 → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁)))

Theoremnbupgrres 40592* The neighborhood of a vertex in a restricted pseudograph (not necessarily valid for a hypergraph, because 𝑁, 𝐾 and 𝑀 could be connected by one edge, so 𝑀 is a neighbor of 𝐾 in the original graph, but not in the restricted graph, because the edge between 𝑀 and 𝐾, also incident with 𝑁, was removed). (Contributed by Alexander van der Vekens, 2-Jan-2018.) (Revised by AV, 8-Nov-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝐹 = {𝑒𝐸𝑁𝑒}    &   𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩       (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → (𝑀 ∈ (𝐺 NeighbVtx 𝐾) → 𝑀 ∈ (𝑆 NeighbVtx 𝐾)))

Theoremusgrnbcnvfv 40593 Applying the edge function on the converse edge function applied on a pair of a vertex and one of its neighbors is this pair in a simple graph. (Contributed by Alexander van der Vekens, 18-Dec-2017.) (Revised by AV, 27-Oct-2020.)
𝐼 = (iEdg‘𝐺)       ((𝐺 ∈ USGraph ∧ 𝑁 ∈ (𝐺 NeighbVtx 𝐾)) → (𝐼‘(𝐼‘{𝐾, 𝑁})) = {𝐾, 𝑁})

Theoremnbusgredgeu 40594* For each neighbor of a vertex there is exactly one edge between the vertex and its neighbor in a simple graph. (Contributed by Alexander van der Vekens, 17-Dec-2017.) (Revised by AV, 27-Oct-2020.)
𝐸 = (Edg‘𝐺)       ((𝐺 ∈ USGraph ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝑁)) → ∃!𝑒𝐸 𝑒 = {𝑀, 𝑁})

Theoremedgnbusgreu 40595* For each edge incident to a vertex there is exactly one neighbor of the vertex also incident to this edge in a simple graph. (Contributed by AV, 28-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝑁 = (𝐺 NeighbVtx 𝑀)       (((𝐺 ∈ USGraph ∧ 𝑀𝑉) ∧ (𝐶𝐸𝑀𝐶)) → ∃!𝑛𝑁 𝐶 = {𝑀, 𝑛})

Theoremnbusgredgeu0 40596* For each neighbor of a vertex there is exactly one edge between the vertex and its neighbor in a simple graph. (Contributed by Alexander van der Vekens, 17-Dec-2017.) (Revised by AV, 27-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝑁 = (𝐺 NeighbVtx 𝑈)    &   𝐼 = {𝑒𝐸𝑈𝑒}       (((𝐺 ∈ USGraph ∧ 𝑈𝑉) ∧ 𝑀𝑁) → ∃!𝑖𝐼 𝑖 = {𝑈, 𝑀})

Theoremnbusgrf1o0 40597* The mapping of neighbors of a vertex to edges incident to the vertex is a bijection ( 1-1 onto function) in a simple graph. (Contributed by Alexander van der Vekens, 17-Dec-2017.) (Revised by AV, 28-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝑁 = (𝐺 NeighbVtx 𝑈)    &   𝐼 = {𝑒𝐸𝑈𝑒}    &   𝐹 = (𝑛𝑁 ↦ {𝑈, 𝑛})       ((𝐺 ∈ USGraph ∧ 𝑈𝑉) → 𝐹:𝑁1-1-onto𝐼)

Theoremnbusgrf1o1 40598* The set of neighbors of a vertex is isomorphic to the set of edges containing the vertex in a simple graph. (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 28-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)    &   𝑁 = (𝐺 NeighbVtx 𝑈)    &   𝐼 = {𝑒𝐸𝑈𝑒}       ((𝐺 ∈ USGraph ∧ 𝑈𝑉) → ∃𝑓 𝑓:𝑁1-1-onto𝐼)

Theoremnbusgrf1o 40599* The set of neighbors of a vertex is isomorphic to the set of edges containing the vertex in a simple graph. (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 28-Oct-2020.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ USGraph ∧ 𝑈𝑉) → ∃𝑓 𝑓:(𝐺 NeighbVtx 𝑈)–1-1-onto→{𝑒𝐸𝑈𝑒})

Theoremnbedgusgr 40600* The number of neighbors of a vertex is the number of edges at the vertex in a simple graph. (Contributed by AV, 27-Dec-2020.) (Proof shortened by AV, 5-May-2021.)
𝑉 = (Vtx‘𝐺)    &   𝐸 = (Edg‘𝐺)       ((𝐺 ∈ USGraph ∧ 𝑈𝑉) → (#‘(𝐺 NeighbVtx 𝑈)) = (#‘{𝑒𝐸𝑈𝑒}))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42360
 Copyright terms: Public domain < Previous  Next >