Search results
Jump to navigation
Jump to search
Page title matches
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...21 KB (3,922 words) - 10:31, 16 April 2014
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...19 KB (3,541 words) - 07:47, 25 December 2015
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 05:10, 9 November 2016
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 06:10, 22 November 2017
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 05:55, 12 November 2019
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 08:55, 4 May 2023
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...21 KB (3,922 words) - 01:04, 3 November 2011
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...21 KB (3,922 words) - 08:56, 20 May 2013
Page text matches
- #REDIRECT [[组合数学 (Fall 2011)/Extremal graph theory]] ...60 bytes (5 words) - 02:58, 17 August 2011
- [[File:London Underground Zone 2.png|thumb|Real-world example of a graph: The central part of the [[London Underground]] map.]] ...rection are called ''undirected'', and the graph is called an ''undirected graph''. If two vertices are connected by an edge, they are called ''adjacent''. ...3 KB (488 words) - 18:43, 22 August 2017
- * Diestel. G''raph Theory, <font color=red>3rd edition or later</font>.'' Springer-Verlag. (If you on ...vits, and Szemerédi. '''The Regularity Lemma and Its Applications in Graph Theory.''' ''Theoretical Aspects of Computer Science'', 2002. [[media:Regularity.a ...887 bytes (120 words) - 10:20, 4 January 2011
- * 概率论（Probability Theory） # [[组合数学 (Spring 2016)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]]（ [http://tcs.nju.edu.cn/slides/comb2016/Polya.pdf ...6 KB (479 words) - 10:20, 12 September 2017
- * 概率论（Probability Theory） # [[组合数学 (Spring 2014)/Pólya's theory of counting|Pólya's theory of counting]] ...9 KB (998 words) - 05:12, 11 June 2014
- * 概率论（Probability Theory） # [[组合数学 (Fall 2011)/Pólya's theory of counting|Pólya's theory of counting]] ...13 KB (1,447 words) - 12:47, 15 September 2017
- * 概率论（Probability Theory） # [[组合数学 (Spring 2013)/Pólya's theory of counting|Pólya's theory of counting]] | [http://tcs.nju.edu.cn/slides/comb2013/comb6.pdf slides1] | ...11 KB (1,243 words) - 12:46, 15 September 2017
- * 概率论（Probability Theory） # [[组合数学 (Spring 2015)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]]（ [http://tcs.nju.edu.cn/slides/comb2015/PolyaTheor ...11 KB (1,070 words) - 12:46, 15 September 2017
- * 概率论（Probability Theory） # [[组合数学 (Fall 2017)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] （ [http://tcs.nju.edu.cn/slides/comb2017/Polya.pdf ...11 KB (1,223 words) - 07:38, 2 January 2018
- [[File:Fixed point example.svg|thumb|A graph of a function with three fixed points]] [[Category:Systems theory]] ...528 bytes (80 words) - 09:20, 13 July 2013
- * 概率论（Probability Theory） # [[Combinatorics (Fall 2010)/Extremal set theory|Extremal set theory]] | [http://lamda.nju.edu.cn/yinyt/notes/comb2010/comb8.pdf slides] ...12 KB (1,494 words) - 14:27, 3 September 2011
- * 概率论（Probability Theory） # [[组合数学 (Fall 2019)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] （ [http://tcs.nju.edu.cn/slides/comb2019/Polya.pdf ...12 KB (1,290 words) - 06:43, 27 December 2019
- ...dges, and girth at least <math> k </math>. (Hint: Try to generate a random graph with <math> n </math> vertices and then fix things up!) Let <math>G = (V, E)</math> be an undirected graph and suppose each <math>v \in V</math> is ...3 KB (522 words) - 11:43, 16 May 2023
- * 概率论（Probability Theory） # [[组合数学 (Fall 2023)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] ([http://tcs.nju.edu.cn/slides/comb2023/Polya.pdf ...14 KB (1,438 words) - 18:58, 9 April 2024
- ...search problems in graphs, and has theoretical significance in complexity theory. The problem can be solved deterministically by traversing the graph <math>G(V,E)</math>, which takes <math>\Omega(n)</math> extra space to keep ...3 KB (468 words) - 10:48, 29 December 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 ...8 KB (1,407 words) - 02:23, 25 July 2011
- == Problem 3 (Probability meets graph theory) == ...math>1</math> (as <math>n</math> tends to infinity) the Erdős–Rényi random graph <math>\mathbf{G}(n,p)</math> has the property that every pair of its vertic ...7 KB (1,107 words) - 07:46, 25 April 2023
- 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 ...11 KB (2,031 words) - 01:33, 24 July 2011
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 08:55, 4 May 2023
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 06:10, 22 November 2017
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 05:10, 9 November 2016
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...18 KB (3,527 words) - 05:55, 12 November 2019
- ...llest number <math>R(k,\ell)</math> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. Prove that: Suppose that <math>M,M'</math> are matchings in a bipartite graph <math>G</math> with bipartition <math>A,B</math>. Suppose that all the vert ...2 KB (461 words) - 02:48, 10 June 2023
- == Extremal Graph Theory == Extremal grap theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" ...21 KB (3,921 words) - 08:23, 13 November 2010
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...19 KB (3,541 words) - 07:47, 25 December 2015
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...21 KB (3,922 words) - 01:04, 3 November 2011
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...21 KB (3,922 words) - 08:56, 20 May 2013
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <math>|E|\le\frac{n^2}{4} ...21 KB (3,922 words) - 10:31, 16 April 2014
- == 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 ...15 KB (2,745 words) - 10:19, 4 January 2011
- #* [[随机算法 (Fall 2011)/Graph Connectivity|Graph Connectivity]] #* [[随机算法 (Fall 2011)/Graph Coloring|Graph Coloring]] ...12 KB (1,037 words) - 12:45, 15 September 2017
- == Problem 5 (Probability meets graph theory) == <li>[<strong>Erdős–Rényi random graph</strong>] ...14 KB (2,403 words) - 10:41, 7 April 2023
- 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 ...23 KB (4,153 words) - 08:30, 12 October 2010
- 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 ...23 KB (4,153 words) - 08:18, 16 August 2011
- ...results in spectral graph theory is the following theorem which relate the graph expansion to the spectral gap. :Let <math>G</math> be a <math>d</math>-regular graph with spectrum <math>\lambda_1\ge\lambda_2\ge\cdots\ge\lambda_n</math>. Then ...14 KB (2,683 words) - 15:16, 13 December 2011
- * 概率论（Probability Theory） # [[组合数学 (Fall 2024)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] ([http://tcs.nju.edu.cn/slides/comb2024/Polya.pdf ...9 KB (950 words) - 18:42, 29 April 2024
- ...he problem and an output is called a '''solution''' to that instance. The theory of complexity deals almost exclusively with [http://en.wikipedia.org/wiki/D ...itself is a certificate. And for the later one, a Hamiltonian cycle in the graph is a certificate (given a cycle, it is easy to verify whether it is Hamilto ...11 KB (1,828 words) - 06:00, 27 August 2011
- ...h> and <math>W</math> denotes the maximum edge weight. When the underlying graph is super dense, namely, the total number of insertions <math>m</math> is <m :In this work, we provide two algorithms for this problem when the graph is sparse. The first one is a simple deterministic algorithm with <math>\ti ...16 KB (900 words) - 04:52, 13 November 2020
- ...h> and <math>W</math> denotes the maximum edge weight. When the underlying graph is super dense, namely, the total number of insertions <math>m</math> is <m :In this work, we provide two algorithms for this problem when the graph is sparse. The first one is a simple deterministic algorithm with <math>\ti ...16 KB (900 words) - 04:54, 13 November 2020
- ...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 ...19 KB (3,610 words) - 08:59, 28 May 2014
- ...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 ...19 KB (3,610 words) - 14:17, 19 June 2013
- #* [https://theory.stanford.edu/~jvondrak/MATH233A-2018/Math233-lec02.pdf Professor Jan Vondrá # Spectral graph theory and Cheeger's inequality ([[Media:L8 spectral-graph-theory.pdf|slides]]) ...13 KB (1,427 words) - 15:57, 9 January 2024
- ...[[Abstract algebra]] || [[Linear algebra]] || [[Order theory]] || [[Graph theory]] ...l equation]]s || [[Dynamical systems theory|Dynamical systems]] || [[Chaos theory]] ...9 KB (1,088 words) - 18:04, 22 August 2017
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 02:36, 31 October 2017
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 13:27, 9 April 2024
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 03:49, 24 October 2016
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 09:24, 19 April 2013
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 09:36, 2 April 2014
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 09:37, 9 November 2015
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 08:14, 16 October 2019
- Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , ...>v</math> shakes hand. The handshaking lemma states that in any undirected graph, the number of vertices whose degrees are odd is even. It is sufficient to ...14 KB (2,455 words) - 12:56, 18 April 2023