Extremal combinatorics: Difference between revisions

Revision as of 10:11, 3 November 2007

Revision as of 19:21, 12 July 2008

Line 1:

'''Extremal combinatorics''' is a field of [[combinatorics]], which is itself a part of [[mathematics]]. Extremal combinatorics studies how large or how small a collection of finite objects ([[number]]s, [[graph (mathematics)|graph]]s, [[vector space|vector]]s, [[set]]s, etc.) can be, if it has to satisfy certain restrictions.

For example, how many people can we invite to a party where among each three people there are two who know each other and two who don't know each other? An easy [[Ramsey theory|Ramsey-type]] argument shows that at most five persons can attend such a party. Or, suppose we are given a finite set of nonzero integers, and are asked to mark an as large a subset as possible subset of themthis set under the restriction that the sum of any two marked integers cannot be marked. It appears that (independent of what the given integers actually are!) we can always mark at least one-third of them.

==References==