Extremal combinatorics: Difference between revisions

Content deleted Content added
fix link to set (mathematics) using AWB
m see also
Line 2:
 
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 as large a subset as possible of this 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.
 
==See also==
[[Extremal graph theory]]
 
==References==