Search results
Jump to navigation
Jump to search
- Consider a graph <math>G(V,E)</math> which is randomly generated as: Such graph is denoted as '''<math>G(n,p)</math>'''. This is called the '''Erdős–Rényi ...21 KB (3,837 words) - 09:44, 1 April 2013
- ...article. The number following the name of the group is the [[order (group theory)|order]] of the group. | [[File:Complete graph K5.svg|105px]] ...8 KB (1,007 words) - 05:56, 15 September 2016
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...33 KB (6,636 words) - 03:02, 5 June 2024
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...33 KB (6,636 words) - 05:50, 13 June 2023
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...33 KB (6,643 words) - 10:48, 4 December 2016
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...33 KB (6,643 words) - 11:00, 20 December 2019
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...33 KB (6,643 words) - 03:26, 22 December 2015
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...33 KB (6,643 words) - 07:40, 18 December 2017
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...23 KB (4,382 words) - 05:07, 5 November 2010
- ...s usually stated as a theorem for the existence of matching in a bipartite graph. In a graph <math>G(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an indep ...23 KB (4,382 words) - 02:41, 17 August 2011
- ...been used in proofs of many important results in computational complexity theory, such as [http://en.wikipedia.org/wiki/SL_(complexity) SL]=[http://en.wikip Consider an undirected (multi-)graph <math>G(V,E)</math>, where the parallel edges between two vertices are allo ...37 KB (6,824 words) - 02:20, 29 December 2015
- == Graph Expansion == ...been used in proofs of many important results in computational complexity theory, such as [http://en.wikipedia.org/wiki/SL_(complexity) SL]=[http://en.wikip ...35 KB (6,195 words) - 08:39, 7 June 2010
- ...r function''' is a [[Function (mathematics)|function]] whose [[:wikt:graph|graph]] is a [[Line|straight line]] in 2-dimensions (see images).<ref>{{cite book ...a linear function is a function ''f''(''x''):'''R'''→'''R''' such that the graph of ''f'' is a line. This means the [[function (mathematics)|domain]] or inp ...14 KB (2,194 words) - 00:02, 2 January 2015
- ...been used in proofs of many important results in computational complexity theory, such as [http://en.wikipedia.org/wiki/SL_(complexity) SL]=[http://en.wikip Consider an undirected (multi-)graph <math>G(V,E)</math>, where the parallel edges between two vertices are allo ...41 KB (7,547 words) - 09:24, 22 May 2023
- In probability theory, the word "condition" is a verb. "Conditioning on the event ..." means that = Min-Cut in a Graph = ...22 KB (4,084 words) - 10:22, 6 March 2013
- ...l type of equation is called the function. This is often used in making [[graph]]s. ...mber or numbers into and get a certain number out. When using functions, [[graph]]s can be powerful tools in helping us to study the solutions to equations. ...13 KB (2,204 words) - 07:13, 30 July 2017
- ...ing a leaf (along with the edge adjacent to it) from a tree, the resulting graph is still a tree. :let <math>T</math> be empty graph, and <math>v_{n-1}=n</math>; ...21 KB (3,832 words) - 15:23, 7 October 2011
- '''Probability Theory''' <br> & '''Mathematical Statistics'''</font> This is the webpage for the ''Probability Theory and Mathematical Statistics'' (概率论与数理统计) class of Spring 2024. Students who ...21 KB (2,159 words) - 03:46, 10 July 2024
- '''Probability Theory''' <br> & '''Mathematical Statistics'''</font> This is the webpage for the ''Probability Theory and Mathematical Statistics'' (概率论与数理统计) class of Spring 2023. Students who ...21 KB (2,167 words) - 07:44, 27 February 2024
- Consider a graph <math>G(V,E)</math> which is randomly generated as: Such graph is denoted as '''<math>G(n,p)</math>'''. This is called the '''Erdős–Rényi ...22 KB (3,809 words) - 05:34, 19 March 2014