Search results
Jump to navigation
Jump to search
- ...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) - 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
- 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
- '''Probability Theory''' <br> & '''Mathematical Statistics'''</font> This is the webpage for the ''Probability Theory and Mathematical Statistics'' (概率论与数理统计) class of Spring 2024. Students who ...15 KB (1,488 words) - 11:17, 6 May 2024
- == Problem 5 (Probability meets graph theory) == Let <math>G = (V, E)</math> be a <strong>fixed</strong> undirected graph without isolating vertex. ...14 KB (2,465 words) - 19:27, 13 April 2024
- * a directed graph <math>G(V,E)</math>; A fundamental fact in flow theory is that cuts always upper bound flows. ...15 KB (3,049 words) - 03:53, 17 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 ...20 KB (1,328 words) - 14:52, 20 November 2020
- === Ramsey's theorem for graph === {{Theorem|Ramsey's Theorem (graph, multicolor)| ...17 KB (3,025 words) - 11:53, 21 November 2011
- [[File:Hyperbola E.svg|thumb|The area shown in blue (under the graph of the equation y=1/x) stretching from 1 to e is exactly 1.]] [[Category:Number theory]] ...3 KB (351 words) - 09:48, 24 June 2017
- * [http://theory.stanford.edu/~yuhch123/ Huacheng Yu] (Harvard) |align="center"|[http://theory.stanford.edu/~yuhch123/ Huacheng Yu] (俞华程)<br> ...14 KB (1,850 words) - 01:51, 7 May 2018
- ...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 ...34 KB (6,244 words) - 15:28, 8 June 2013