An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics, the Milliken–Taylor theorem in combinatorics is a generalization of both Ramsey's theorem and Hindman's theorem. It is named after Keith Milliken and Alan D. Taylor. Let denote the set of finite subsets of , and define a partial order on by α<β if and only if max α and k > 0, let Let denote the k-element subsets of a set S. The Milliken–Taylor theorem says that for any finite partition , there exist some i ≤ r and a sequence such that .

Property Value
dbo:abstract
  • In mathematics, the Milliken–Taylor theorem in combinatorics is a generalization of both Ramsey's theorem and Hindman's theorem. It is named after Keith Milliken and Alan D. Taylor. Let denote the set of finite subsets of , and define a partial order on by α<β if and only if max α and k > 0, let Let denote the k-element subsets of a set S. The Milliken–Taylor theorem says that for any finite partition , there exist some i ≤ r and a sequence such that . For each , call an MTk set. Then, alternatively, the Milliken–Taylor theorem asserts that the collection of MTk sets is partition regular for each k. (en)
dbo:wikiPageID
  • 4277566 (xsd:integer)
dbo:wikiPageLength
  • 2470 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032323858 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdf:type
rdfs:comment
  • In mathematics, the Milliken–Taylor theorem in combinatorics is a generalization of both Ramsey's theorem and Hindman's theorem. It is named after Keith Milliken and Alan D. Taylor. Let denote the set of finite subsets of , and define a partial order on by α<β if and only if max α and k > 0, let Let denote the k-element subsets of a set S. The Milliken–Taylor theorem says that for any finite partition , there exist some i ≤ r and a sequence such that . (en)
rdfs:label
  • Milliken–Taylor theorem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License