Search results
Jump to navigation
Jump to search
- :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) - 14:17, 19 June 2013
- ...(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
- ...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
- ...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
- 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>. ...18 KB (3,527 words) - 09:38, 14 May 2024
- 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) - 17:15, 14 May 2024
- 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