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 co.combinatorics
Search options not deleted
user 33625
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
5
votes
2
answers
187
views
If $\kappa \rightarrow (\alpha)^r_2$ holds for every $r\in \omega$, then is $\kappa$ an $\al...
If $\kappa \rightarrow (\alpha)^r_2$ holds for every $r\in \omega$, then is $\kappa$ an $\alpha$-Erdős cardinal? (or rather, does $\kappa \rightarrow (\alpha)^{<\omega}_2$ hold?)
$\kappa \rightarrow …
- 133
13
votes
2
answers
1k
views
Why does the generalised Galvin-Prikry Theorem only hold at Ramsey cardinals?
The Galvin-Prikry theorem says that Borel sets are Ramsey. This means that for every Borel set $S\subseteq[\omega]^\omega$, there is an $A\in[\omega]^\omega$ such that either $[A]^\omega \subseteq S$ …
- 133