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 14490
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
Ramsey type properties of $F_\sigma$ ideals
Well, a positive answer would have been nice, but unfortunately I think there is an easy argument to build a computable instance of $\mathrm{RT^2_{3,2}}$ whose every solution falls in the summable ide …
- 764
2
votes
1
answer
117
views
Ramsey type properties of $F_\sigma$ ideals
Let $I \subseteq 2^\omega$ be any $F_\sigma$ ideal containing every finite sets :
$\forall X \in I\ \forall Y \subseteq X\ \text{ we have } Y \in I$
$\forall k\ \forall X_1,\dots,X_k \in I\ X_1 \cup …
- 764