Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with ramsey-theory
Search options not deleted
user 468
Branch of combinatorics with the philosophy that 'total disorder is impossible'. For example, Ramsey's theorem asserts that for each $n$, every sufficiently large graph either contains a clique of size $n$ or a stable set of size $n$.
2
votes
Accepted
Permutations of Grid Colorings
O(1) is impossible even if you drop the condition of no monochromatic rectangles, and even if you know that the two cells are always chosen within a given row.
Suppose the length of the rows, $m$, …
- 6,327
5
votes
Bound on cardinality of a union
A better solution than my previous one is
max_{1\leq i \leq n} iN - {i \choose 2}N_2
(That is to say, we can simply consider only i of the sets instead of all n of them, and then apply my previous …
- 6,327
2
votes
Bound on cardinality of a union
There is the obvious lower bound of nN - {n \choose 2}N_2.
(I'm taking N_2 to be the bound on the size of an intersection of 2 sets; I'm not sure if that's what you meant.)
I don't think it's poss …
- 6,327