Search results
Jump to navigation
Jump to search
Page title matches
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...50 KB (8,991 words) - 12:23, 21 May 2023
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...25 KB (4,389 words) - 09:05, 12 January 2011
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...25 KB (4,408 words) - 01:20, 10 November 2011
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...24 KB (4,365 words) - 11:50, 5 June 2013
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...32 KB (5,800 words) - 07:57, 21 May 2014
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...25 KB (4,523 words) - 13:54, 27 December 2015
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 02:49, 24 November 2016
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 13:32, 2 December 2017
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 07:54, 28 November 2019
- :Let <math>\mathcal{F}\subseteq 2^X</math> be set family and let <math>R\subseteq X</math> be a subset. The '''trace''' of <m ...nsion '''VC dimension'''] is defined by the power of a family to shatter a set. ...25 KB (4,480 words) - 04:58, 17 November 2010
- :Let <math>\mathcal{F}\subseteq 2^X</math> be set family and let <math>R\subseteq X</math> be a subset. The '''trace''' of <m ...nsion '''VC dimension'''] is defined by the power of a family to shatter a set. ...25 KB (4,480 words) - 08:23, 16 August 2011
Page text matches
- #REDIRECT [[Combinatorics (Fall 2010)/Extremal set theory II]] ...62 bytes (7 words) - 06:45, 3 November 2010
- This is a (temporary) homepage for the probability theory course at Zhiyuan college. *[[概率论 (Summer 2014)/Problem Set 1|Problem Set 1]], due on July 25, Friday, in class. ...203 bytes (26 words) - 11:41, 17 July 2014
- This is a (temporary) homepage for the probability theory course at Zhiyuan college. *[[概率论 (Summer 2013)/Problem Set 1|Problem Set 1]], due on July 11, Thursday, in class. ...572 bytes (68 words) - 09:02, 1 August 2013
- ...''B'' is ''greater than or equal to'' (or ''more than or equal'' members) set ''B'' if and only if there is an injective function from ''A'' to ''B''. ...set is only one way of giving a number to the ''size'' of a set. [[Measure theory|Measure]] is different. ...2 KB (375 words) - 06:00, 4 July 2015
- * 概率论（Probability Theory） *[[组合数学 (Fall 2016)/Problem Set 1|Problem Set 1]] due on Oct. 10 in class. ...6 KB (479 words) - 10:20, 12 September 2017
- ...'proper subset'''. We use the symbol ⊆ to say a set is a subset of another set. We can also use ⊂ if it is a proper subset. The symbols ⊃ ⊇ are opposite - ...[interval]] [0;1] is a proper subset of the set of [[real number]]s or the set of [[positive number]]s. ...980 bytes (159 words) - 10:02, 8 June 2017
- ...]], an '''alphabet''' is a [[finite set|finite]] [[empty set|non-empty]] [[set]]. The [[element]]s of an alphabet are called the '''letters''' or '''symbo The set of [[natural number]]s is '''not''' an alphabet because as it is not finite ...3 KB (400 words) - 06:51, 6 July 2016
- ...artesian product''' of ''A'' with ''B'' is written as ''A × B'' and is the set of all [[ordered pair|ordered pairs]] whose first element is a member of '' [[Category:Set theory]] ...497 bytes (82 words) - 22:03, 12 March 2013
- ...algebraic structure]]. It is a [[set]] with a [[binary operation]] on that set. ...that do not have to be different) and returning some other element of that set. ...1 KB (250 words) - 05:20, 8 November 2014
- ...of a [[set]] is the cardinal number that tells how many things are in the set. [[Category:Number theory]] ...1 KB (154 words) - 17:56, 8 October 2014
- * 概率论（Probability Theory） *[[组合数学 (Spring 2014)/Problem Set 1|Problem Set 1]], due on March 27, Thursday, in class. ...9 KB (998 words) - 05:12, 11 June 2014
- ...set. Both elements b and c of the first set map to element z of the second set.]] The relation is ''homogeneous'' when it is formed with one set. ...4 KB (674 words) - 06:35, 19 August 2017
- * 概率论（Probability Theory） *[[组合数学 (Spring 2013)/Problem Set 1|Problem Set 1]], due on April 4, Thursday, in class. ...11 KB (1,243 words) - 12:46, 15 September 2017
- * 概率论（Probability Theory） *[[组合数学 (Fall 2015)/Problem Set 1|Problem Set 1]] due on Oct. 13 in class. ...11 KB (1,070 words) - 12:46, 15 September 2017
- * 概率论（Probability Theory） *[[组合数学 (Fall 2017)/Problem Set 1|Problem Set 1]] due on Oct 9, in class. ...11 KB (1,223 words) - 07:38, 2 January 2018
- * 概率论（Probability Theory） * (2011/09/15) [[组合数学 (Fall 2011)/Problem set 1|Problem set 1]] due on Sept 22, in class. ...13 KB (1,447 words) - 12:47, 15 September 2017
- * 概率论（Probability Theory） *[[组合数学 (Fall 2019)/Problem Set 1|Problem Set 1]] due on Sept 25, in class. [[组合数学 (Fall 2019)/作业1已提交名单 | 当前作业1已提交名单]]. ...12 KB (1,290 words) - 06:43, 27 December 2019
- * 概率论（Probability Theory） * (2010/09/17) [[Combinatorics (Fall 2010)/Problem set 1|Problem set 1]] due on Sept 25, in class. ...12 KB (1,494 words) - 14:27, 3 September 2011
- * 概率论（Probability Theory） * [[组合数学 (Fall 2023)/Problem Set 1|Problem Set 1]]，请在 2023/03/24 上课之前提交到 [mailto:njucomb23@163.com njucomb23@163.com] (文件名 ...14 KB (1,438 words) - 18:58, 9 April 2024
- ...ey wouldn't miss any of the numbers. Sometimes when people say 'countable set' they mean countable and infinite. [[Georg Cantor]] coined the term. Countable sets include all sets with a [[finite set|finite]] number of members, no matter how many. ...2 KB (379 words) - 14:57, 30 April 2017
- * the set of all words over <math>{a, b}\,</math> * the set <math>\left \{ a^{n}\right\}</math>, where <math>n\,</math> is a [[natural ...5 KB (710 words) - 00:57, 25 February 2017
- ...set definition of Georg Cantor.png|thumb|Cantor's original definition of a set: ''By an aggregate (..) we are to understand any collection into a whole (. ...Anything'' can be a member of a set. A set can be a member of a set. (If a set is a member of itself, '''beware''' of [[Russell's paradox]].) ...10 KB (1,884 words) - 16:03, 30 June 2015
- ...''') is a concept from [[mathematics]]. In many ways, multisets are like [[set]]s. Certain items are either elements of that multiset, or they are not. Ho ...me]] factors of a number ''n''. Here the underlying set of elements is the set of prime [[divisor]]s of ''n''. For example the number ''120'' has the [[fa ...2 KB (326 words) - 23:54, 8 March 2013
- ...h theory]] a '''graph''' is used to represent the connection between two [[set]]s. One of the sets contains nodes (which are officially called '''vertices ...t, where an edge that connects to the vertex at both ends (a [[loop (graph theory)|loop]]) is counted twice. ...3 KB (488 words) - 18:43, 22 August 2017
- ..."traditional" or "economic" [[game theory]]. CGT arose in relation to the theory of impartial games, the two-player game of [[Nim]] in particular, with an e Combinatorial Game Theory is largely confined to the study of a subset of combinatorial games which a ...6 KB (1,097 words) - 23:35, 19 September 2015
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...7 KB (1,250 words) - 06:01, 27 August 2011
- * 概率论（Probability Theory） * [[组合数学 (Fall 2024)/Problem Set 1|Problem Set 1]] [[组合数学 (Spring 2024)/第一次作业提交名单|第一次作业提交名单]] ...9 KB (950 words) - 18:42, 29 April 2024
- :''This article is about the basic notions. For advanced topics, see [[Group theory]].'' ...ake a third element, also in the set. A familiar example of a group is the set of [[integer]]s together with the [[addition]] operator. ...6 KB (1,063 words) - 03:41, 3 March 2017
- A '''time signature''' is a set of two [[numbers]], one on top of the other one, written right after the [[ {{music theory}} ...3 KB (480 words) - 10:12, 20 June 2016
- ...equations are called [[wikt:equivalent|equivalent]] if they have the same set of [[Algebraic solutions|solutions]]. This means that all solutions of the ...'''. When solving an equation, we need to say in which [[Set (mathematics)|set]] the solutions are allowed. For example, for an equation over the rational ...3 KB (410 words) - 06:25, 6 July 2016
- ...real number can simply be written as <math>a + 0 \cdot i</math> or as the set {{math|(''a'', 0)}}.<ref name="wa" /> The set of all complex numbers is usually written as <math>\mathbb{C}</math>. ...6 KB (917 words) - 00:53, 5 February 2017
- Usually the input "data stream" is from a massive data set (e.g. search engine data), so you cannot afford storing the entire input. M (Interviewing problem of Theory Group in Microsoft Research Asia for student interns.) ...3 KB (443 words) - 01:40, 19 September 2011
- In formal [[number theory]] a '''Gödel numbering''' is a [[function (mathematics)|function]] which as ...equivalence theorem]] states criteria for which those numberings of the set of computable functions are Gödel numberings. ...5 KB (850 words) - 23:57, 1 January 2015
- == Assumption throughout Problem Set 3== == Problem 3 (Probability meets graph theory) == ...7 KB (1,107 words) - 07:46, 25 April 2023
- | rowspan=2|[[set theory|set membership]] | a∈S means that a is an element of the set S ...8 KB (1,182 words) - 07:31, 3 November 2013
- ...osure of [[intersection]]. Open sets have infinite closure of [[union (set theory)|union]]. That is, in mathematical notation, if A<sub>0</sub>, and A<sub>1< ...2 KB (271 words) - 03:33, 15 January 2015
- ...a [[coordinate system]]. This means that every place can be specified by a set of three numbers, called coordinates. ...ne by the Babylonians; Ancient Greeks, like [[Ptolemy]] later extended the theory. ...2 KB (271 words) - 22:25, 4 November 2016
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...16 KB (2,701 words) - 02:51, 18 August 2011
- <math>\mathbf{Z}</math> or <math>\mathbb{Z}</math> is the name of the [[set]] of integers. (<math>\mathbf{Z}</math>, +, 0) is an [[abelian group]]. [[Category:Number theory]] ...2 KB (304 words) - 08:49, 14 March 2017
- ...ht, "Chromatic Features of E♭-Major Works of the Classical Period" ''Music Theory Spectrum'' '''22''' 2 (2000): 178</ref> ...t to A and E a [[perfect fifth|fifth]] apart. In most other keys, they are set a [[perfect fourth|fourth]] apart. ...3 KB (414 words) - 12:26, 11 March 2013
- Normal [[hotel]]s have a set number of rooms. This number is [[finite]]. Once every room has been assign ...d-numbered rooms is the same as the cardinality of the [[Set (mathematics)|set]] of all rooms. Indeed, infinite sets are characterized as sets that have p ...5 KB (910 words) - 20:39, 8 September 2016
- *[[高级算法 (Fall 2020)/Problem Set 1|Problem Set 1]] due on 2020/10/14 课上交纸质版作业（可以打印电子稿）. [[高级算法 (Fall 2020)/第一次作业提交名单|第一次作 *[[高级算法 (Fall 2020)/Problem Set 2|Problem Set 2]] due on 2020/11/18 课上交纸质版作业（可以打印电子稿）. [[高级算法 (Fall 2020)/第二次作业提交名单|第二次作 ...10 KB (797 words) - 08:56, 13 January 2021
- *[[随机算法 (Spring 2014)/Problem Set 1|Problem Set 1]], due on March 18, Tuesday, in class. *[[随机算法 (Spring 2014)/Problem Set 2|Problem Set 2]], due on April 8, Tuesday, in class. ...9 KB (846 words) - 07:34, 2 June 2014
- ...[[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
- ...'median''' is a [[number]]. This number has the property that it divides a set of observed values in two equal halves, so that half of the values are belo ...es while the other numbers of this set are kept the same, the mean of this set of numbers changes, but the median does not. ...4 KB (751 words) - 08:12, 21 August 2016
- '''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,465 words) - 13:36, 30 April 2024
- *[[随机算法 (Spring 2013)/Problem Set 1|Problem Set 1]], due on March 26, Tuesday, in class. *[[随机算法 (Spring 2013)/Problem Set 2|Problem Set 2]], due on April 23, Tuesday, in class. ...10 KB (1,029 words) - 12:44, 15 September 2017
- *[[随机算法 (Fall 2015)/Problem Set 1|Problem Set 1]], due on Oct 9, Friday, in class. *[[随机算法 (Fall 2015)/Problem Set 2|Problem Set 2]], due on Nov 27, Friday, in class. ...9 KB (893 words) - 12:43, 15 September 2017
- * (06/29/2010) [[Randomized Algorithms (Spring 2010)/Problem Set 6 | Problem Set 6]] makeup assignment, hand in before the final exam. * (06/01/2010) [[Randomized Algorithms (Spring 2010)/Problem Set 5 | Problem Set 5]] due on June 15 , Tuesday, in class. 中英文不限。 ...12 KB (1,315 words) - 03:37, 18 July 2011
- ...nt of the second set''. This statement works well for sets with a [[Finite set|finite]] number of elements. It is less intuitive for sets with an infinite ...he natural numbers are called at most countable. With that definition, the set of rational numbers / fractions is countable. ...12 KB (1,234 words) - 02:16, 5 September 2016
- *[[高级算法 (Fall 2023)/Problem Set 1|Problem Set 1]] 请在 2023/11/14 上课之前(14:00 UTC+8)提交到 [mailto:njuadvalg23@163.com njuadva *[[高级算法 (Fall 2023)/Problem Set 2|Problem Set 2]] 请在 2023/12/19 上课之前(14:00 UTC+8)提交到 [mailto:njuadvalg23@163.com njuadva ...13 KB (1,427 words) - 15:57, 9 January 2024
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...15 KB (2,672 words) - 09:10, 22 September 2016
- *[[set theory]] *[[Banach space]] theory ...16 KB (2,241 words) - 05:01, 18 January 2017
- == Assumption throughout Problem Set 2== ...(Hint: Try expressing the event [math]Y=aX+b\le y[/math] by countably many set operations on the events defined on [math]X[/math].)</li> ...14 KB (2,403 words) - 10:41, 7 April 2023
- ...llest number <math>R(k,\ell)</math> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. :Let <math>A_1,A_2,\ldots,A_n</math> be a set of events, and assume that the following hold: ...17 KB (3,025 words) - 11:53, 21 November 2011
- * (2011/09/19) [[随机算法 (Fall 2011)/Problem set 1|Problem set 1]] due on Sept 26, in class. * (2011/10/10) [[随机算法 (Fall 2011)/Problem set 2|Problem set 2]] due on Oct 24, in class. ...12 KB (1,037 words) - 12:45, 15 September 2017
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 10:34, 12 September 2023
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 11:25, 8 September 2020
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 11:58, 14 September 2018
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 09:07, 24 August 2021
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 00:13, 2 September 2019
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 07:31, 5 September 2022
- The axiom foundation of probability theory is laid by [http://en.wikipedia.org/wiki/Andrey_Kolmogorov Kolmogorov], one *<math>\Omega</math> is a set, called the '''sample space'''. ...17 KB (3,030 words) - 07:28, 20 September 2017
- ...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 * The '''Edge Boundary''' of a set <math>S\subset V</math>, denoted <math>\partial S\,</math>, is <math>\parti ...8 KB (1,407 words) - 02:23, 25 July 2011
- ...ord.</ref><sup>p160</sup> It is a central idea in [[evolution|evolutionary theory]]. Fitness is usually equal to the proportion of the individual's [[gene]]s ...well an organism can reproduce, and spread its genes to its offspring. The theory of inclusive fitness says that the fitness of an organism is also increased ...5 KB (696 words) - 14:26, 23 June 2016
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 03:56, 27 October 2015
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 14:25, 29 March 2023
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 04:35, 17 October 2016
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 05:36, 19 March 2014
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 14:54, 28 September 2017
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 07:16, 8 October 2011
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 06:16, 8 October 2019
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 04:27, 27 March 2024
- A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisf :Let <math>S_n</math> denote the set of all permutations of <math>[n]</math>. It is easy to verify that <math>S_ ...19 KB (3,695 words) - 10:46, 17 April 2013
- == Assumption throughout Problem Set 2== ...(Hint: Try expressing the event [math]Y=aX+b\le y[/math] by countably many set operations on the events defined on [math]X[/math].)</li> ...14 KB (2,465 words) - 19:27, 13 April 2024
- The universal quantifier is used to claim that for elements in a set, the elements all match some criteria. Usually, this statement "for all ele The existential quantifier is used to claim that for elements in a set, there exists at least one element that matches some criteria. Usually, thi ...8 KB (1,219 words) - 06:11, 20 June 2016
- '''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
- In the [[atomic theory]] [[solids]], [[liquids]] and [[gases]] are made of tiny particles called " ...gy to travel through the solid. (Rather like the way energy passes along a set of tumbling dominos). ...3 KB (414 words) - 07:43, 16 June 2017
- :Let <math>\mathcal{F}\subseteq 2^X</math> be set family and let <math>R\subseteq X</math> be a subset. The '''trace''' of <m ...nsion '''VC dimension'''] is defined by the power of a family to shatter a set. ...25 KB (4,480 words) - 04:58, 17 November 2010
- :Let <math>\mathcal{F}\subseteq 2^X</math> be set family and let <math>R\subseteq X</math> be a subset. The '''trace''' of <m ...nsion '''VC dimension'''] is defined by the power of a family to shatter a set. ...25 KB (4,480 words) - 08:23, 16 August 2011
- ...olecular orbital]]s. This is used in the [[Hückel method]], [[ligand field theory]], and the [[Woodward–Hoffmann rules]]. Another idea on a larger scale is t ...ic point groups was published in 1936 by Rosenthal and Murphy.<ref>''Group Theory and the Vibrations of Polyatomic Molecules'' Jenny E. Rosenthal and G. M. M ...19 KB (2,913 words) - 21:36, 4 November 2015
- ...(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an independent set for edges, that is, for any <math>e_1,e_2\in M</math> that <math>e_1\neq e_ ...override the notation as <math>N(S)=\bigcup_{v\in S}N(v)</math>, i.e. the set of vertices that are adjacent to one of the vertices in <math>S</math>. ...19 KB (3,610 words) - 08:59, 28 May 2014
- ...(V,E)</math>, a '''matching''' <math>M\subseteq E</math> is an independent set for edges, that is, for any <math>e_1,e_2\in M</math> that <math>e_1\neq e_ ...override the notation as <math>N(S)=\bigcup_{v\in S}N(v)</math>, i.e. the set of vertices that are adjacent to one of the vertices in <math>S</math>. ...19 KB (3,610 words) - 14:17, 19 June 2013
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 13:32, 2 December 2017
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 02:49, 24 November 2016
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 07:54, 28 November 2019
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...32 KB (5,800 words) - 07:57, 21 May 2014
- Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can Let <math>A</math> be the largest independent set in <math>G</math> and let <math>\alpha=|A|</math>. ...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 Let <math>A</math> be the largest independent set in <math>G</math> and let <math>\alpha=|A|</math>. ...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 Let <math>A</math> be the largest independent set in <math>G</math> and let <math>\alpha=|A|</math>. ...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 Let <math>A</math> be the largest independent set in <math>G</math> and let <math>\alpha=|A|</math>. ...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 Let <math>A</math> be the largest independent set in <math>G</math> and let <math>\alpha=|A|</math>. ...19 KB (3,541 words) - 07:47, 25 December 2015
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...24 KB (4,365 words) - 11:50, 5 June 2013
- == Extremal Graph Theory == Extremal grap theory studies the problems like "how many edges that a graph <math>G</math> can ...21 KB (3,921 words) - 08:23, 13 November 2010
- associated with a set <math>S(v)</math> of at least <math>2\mathrm{e}r</math> colors, where <math Prove the following theorem on extremal graph theory: ...3 KB (522 words) - 11:43, 16 May 2023
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...25 KB (4,389 words) - 09:05, 12 January 2011
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...25 KB (4,523 words) - 13:54, 27 December 2015
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...25 KB (4,408 words) - 01:20, 10 November 2011
- Let <math>A_1,A_2,\ldots,A_n\subseteq U</math> be subsets of some finite set <math>U</math>. Here <math>U</math> is some universe of combinatorial objec ...ber of surjective mappings from an <math>n</math>-set to an <math>m</math>-set is given by ...19 KB (3,458 words) - 06:51, 12 October 2015
- Let <math>A_1,A_2,\ldots,A_n\subseteq U</math> be subsets of some finite set <math>U</math>. Here <math>U</math> is some universe of combinatorial objec ...ber of surjective mappings from an <math>n</math>-set to an <math>m</math>-set is given by ...19 KB (3,458 words) - 07:33, 12 March 2014